{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:4RXXKV4637DTUP7FSZ3NVCSUFZ","short_pith_number":"pith:4RXXKV46","canonical_record":{"source":{"id":"1810.08004","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-10-18T11:59:02Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"643b7dc00cbf87fe87b7c8879323c7dc44c7a741a9125c8b973e557a816fd86c","abstract_canon_sha256":"ddc2de025af865b895391c99a3ec8626d40082e6655944194a43375953de8246"},"schema_version":"1.0"},"canonical_sha256":"e46f75579edfc73a3fe59676da8a542e7341ee58e4635cdf71c5f8845a3b3f1b","source":{"kind":"arxiv","id":"1810.08004","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.08004","created_at":"2026-07-05T01:15:54Z"},{"alias_kind":"arxiv_version","alias_value":"1810.08004v4","created_at":"2026-07-05T01:15:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.08004","created_at":"2026-07-05T01:15:54Z"},{"alias_kind":"pith_short_12","alias_value":"4RXXKV4637DT","created_at":"2026-07-05T01:15:54Z"},{"alias_kind":"pith_short_16","alias_value":"4RXXKV4637DTUP7F","created_at":"2026-07-05T01:15:54Z"},{"alias_kind":"pith_short_8","alias_value":"4RXXKV46","created_at":"2026-07-05T01:15:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:4RXXKV4637DTUP7FSZ3NVCSUFZ","target":"record","payload":{"canonical_record":{"source":{"id":"1810.08004","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-10-18T11:59:02Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"643b7dc00cbf87fe87b7c8879323c7dc44c7a741a9125c8b973e557a816fd86c","abstract_canon_sha256":"ddc2de025af865b895391c99a3ec8626d40082e6655944194a43375953de8246"},"schema_version":"1.0"},"canonical_sha256":"e46f75579edfc73a3fe59676da8a542e7341ee58e4635cdf71c5f8845a3b3f1b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:15:54.259712Z","signature_b64":"KtD0pBQcn5BLGQ8GRXfQAjdIh+pBOd9nWL2heNQ8BHH79uk7/PJ9zA7KW+Zot2gGFQMIuzJMHgfjRmi887/NBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e46f75579edfc73a3fe59676da8a542e7341ee58e4635cdf71c5f8845a3b3f1b","last_reissued_at":"2026-07-05T01:15:54.259357Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:15:54.259357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.08004","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T01:15:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x8qC+F/xG8Z/haHE3cMSAqt3GHQvv1FumkFzujBtziGz8kNMU2R5f7pifOYW3QqZBRDGzsIocrVzwekbbe+VAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-19T13:38:52.019418Z"},"content_sha256":"509c390d9a2eadfc4fbfe0eadda4609f12cff8ed81f2e9b74c2387517432c73f","schema_version":"1.0","event_id":"sha256:509c390d9a2eadfc4fbfe0eadda4609f12cff8ed81f2e9b74c2387517432c73f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:4RXXKV4637DTUP7FSZ3NVCSUFZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complexity of Computing the Anti-Ramsey Numbers for Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Alexandru Popa, Golnoosh Shahkarami, Hossein Vahidi, Mohammad Roghani, Reza Soltani, Saeed Akhoondian Amiri","submitted_at":"2018-10-18T11:59:02Z","abstract_excerpt":"The anti-Ramsey numbers are a fundamental notion in graph theory, introduced in 1978, by Erd\\\" os, Simonovits and S\\' os. For given graphs $G$ and $H$ the \\emph{anti-Ramsey number} $\\textrm{ar}(G,H)$ is defined to be the maximum number $k$ such that there exists an assignment of $k$ colors to the edges of $G$ in which every copy of $H$ in $G$ has at least two edges with the same color.\n  There are works on the computational complexity of the problem when $H$ is a star. Along this line of research, we study the complexity of computing the anti-Ramsey number $\\textrm{ar}(G,P_k)$, where $P_k$ is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.08004","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1810.08004/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T01:15:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rd3HGYvq8VF/+3iM0s9hjLpsljSL4sTMITPmTU7R+8cTEFOvi0IrlHW/UitTI+uF5Z9x82lbma9qp9YVcKmFBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-19T13:38:52.020001Z"},"content_sha256":"ed07f043ca7ba7ef482b361727fc602eff347fcbce1445d0061a64bcc27a5643","schema_version":"1.0","event_id":"sha256:ed07f043ca7ba7ef482b361727fc602eff347fcbce1445d0061a64bcc27a5643"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4RXXKV4637DTUP7FSZ3NVCSUFZ/bundle.json","state_url":"https://pith.science/pith/4RXXKV4637DTUP7FSZ3NVCSUFZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4RXXKV4637DTUP7FSZ3NVCSUFZ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-19T13:38:52Z","links":{"resolver":"https://pith.science/pith/4RXXKV4637DTUP7FSZ3NVCSUFZ","bundle":"https://pith.science/pith/4RXXKV4637DTUP7FSZ3NVCSUFZ/bundle.json","state":"https://pith.science/pith/4RXXKV4637DTUP7FSZ3NVCSUFZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4RXXKV4637DTUP7FSZ3NVCSUFZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4RXXKV4637DTUP7FSZ3NVCSUFZ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ddc2de025af865b895391c99a3ec8626d40082e6655944194a43375953de8246","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-10-18T11:59:02Z","title_canon_sha256":"643b7dc00cbf87fe87b7c8879323c7dc44c7a741a9125c8b973e557a816fd86c"},"schema_version":"1.0","source":{"id":"1810.08004","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.08004","created_at":"2026-07-05T01:15:54Z"},{"alias_kind":"arxiv_version","alias_value":"1810.08004v4","created_at":"2026-07-05T01:15:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.08004","created_at":"2026-07-05T01:15:54Z"},{"alias_kind":"pith_short_12","alias_value":"4RXXKV4637DT","created_at":"2026-07-05T01:15:54Z"},{"alias_kind":"pith_short_16","alias_value":"4RXXKV4637DTUP7F","created_at":"2026-07-05T01:15:54Z"},{"alias_kind":"pith_short_8","alias_value":"4RXXKV46","created_at":"2026-07-05T01:15:54Z"}],"graph_snapshots":[{"event_id":"sha256:ed07f043ca7ba7ef482b361727fc602eff347fcbce1445d0061a64bcc27a5643","target":"graph","created_at":"2026-07-05T01:15:54Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1810.08004/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The anti-Ramsey numbers are a fundamental notion in graph theory, introduced in 1978, by Erd\\\" os, Simonovits and S\\' os. For given graphs $G$ and $H$ the \\emph{anti-Ramsey number} $\\textrm{ar}(G,H)$ is defined to be the maximum number $k$ such that there exists an assignment of $k$ colors to the edges of $G$ in which every copy of $H$ in $G$ has at least two edges with the same color.\n  There are works on the computational complexity of the problem when $H$ is a star. Along this line of research, we study the complexity of computing the anti-Ramsey number $\\textrm{ar}(G,P_k)$, where $P_k$ is ","authors_text":"Alexandru Popa, Golnoosh Shahkarami, Hossein Vahidi, Mohammad Roghani, Reza Soltani, Saeed Akhoondian Amiri","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-10-18T11:59:02Z","title":"Complexity of Computing the Anti-Ramsey Numbers for Paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.08004","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:509c390d9a2eadfc4fbfe0eadda4609f12cff8ed81f2e9b74c2387517432c73f","target":"record","created_at":"2026-07-05T01:15:54Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ddc2de025af865b895391c99a3ec8626d40082e6655944194a43375953de8246","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-10-18T11:59:02Z","title_canon_sha256":"643b7dc00cbf87fe87b7c8879323c7dc44c7a741a9125c8b973e557a816fd86c"},"schema_version":"1.0","source":{"id":"1810.08004","kind":"arxiv","version":4}},"canonical_sha256":"e46f75579edfc73a3fe59676da8a542e7341ee58e4635cdf71c5f8845a3b3f1b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e46f75579edfc73a3fe59676da8a542e7341ee58e4635cdf71c5f8845a3b3f1b","first_computed_at":"2026-07-05T01:15:54.259357Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:15:54.259357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KtD0pBQcn5BLGQ8GRXfQAjdIh+pBOd9nWL2heNQ8BHH79uk7/PJ9zA7KW+Zot2gGFQMIuzJMHgfjRmi887/NBg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:15:54.259712Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.08004","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:509c390d9a2eadfc4fbfe0eadda4609f12cff8ed81f2e9b74c2387517432c73f","sha256:ed07f043ca7ba7ef482b361727fc602eff347fcbce1445d0061a64bcc27a5643"],"state_sha256":"aaef461f92dd8ca96118ae58f77c55125a93d73ea3851ed7a242efcee0ff3985"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hRA0ntla2F64rgJpz8NIMQpbaXeWSadPiv5RIuBPUTfiS4TSibUoW/xUwqCHpvEg/olwMDpLExiHOJa6zGv6Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-19T13:38:52.022999Z","bundle_sha256":"01159d856e02a6d632313c0a30fcff420b94356cbb1f5654da5ba404893e1773"}}