{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:FE72TQI32JNQNDOZKBNAUNCTJW","short_pith_number":"pith:FE72TQI3","canonical_record":{"source":{"id":"1310.4331","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-16T11:10:46Z","cross_cats_sorted":[],"title_canon_sha256":"af97b1d3dec01f9ce6ab9963a00512612dd69f5290fceb08510ae71fb06cb5b0","abstract_canon_sha256":"2f48a63e21a0c03bc760ebc9edad0e321cfde9d04ee1928464dec1b008be2b0f"},"schema_version":"1.0"},"canonical_sha256":"293fa9c11bd25b068dd9505a0a34534da4aa4f988533ad43579b9229649535fd","source":{"kind":"arxiv","id":"1310.4331","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.4331","created_at":"2026-05-18T00:44:39Z"},{"alias_kind":"arxiv_version","alias_value":"1310.4331v1","created_at":"2026-05-18T00:44:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.4331","created_at":"2026-05-18T00:44:39Z"},{"alias_kind":"pith_short_12","alias_value":"FE72TQI32JNQ","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FE72TQI32JNQNDOZ","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FE72TQI3","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:FE72TQI32JNQNDOZKBNAUNCTJW","target":"record","payload":{"canonical_record":{"source":{"id":"1310.4331","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-16T11:10:46Z","cross_cats_sorted":[],"title_canon_sha256":"af97b1d3dec01f9ce6ab9963a00512612dd69f5290fceb08510ae71fb06cb5b0","abstract_canon_sha256":"2f48a63e21a0c03bc760ebc9edad0e321cfde9d04ee1928464dec1b008be2b0f"},"schema_version":"1.0"},"canonical_sha256":"293fa9c11bd25b068dd9505a0a34534da4aa4f988533ad43579b9229649535fd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:39.176156Z","signature_b64":"LMoeA0zdMNzMtqiVC0jUJI7R/5YtdZrtym7TaybfwEX1UYVYdSyorJGjsk5/AsdEOwIHghlvTULnM47tfK76AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"293fa9c11bd25b068dd9505a0a34534da4aa4f988533ad43579b9229649535fd","last_reissued_at":"2026-05-18T00:44:39.175745Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:39.175745Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.4331","source_version":1,"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-05-18T00:44:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X7+gU99+SPpLG3b4I3C0rvAe2Pg5XDLjBm7XWlG8maL+4sCU3ttWN6CLozxenbXjsjYKiHyKrur09O0GrZxWDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:37:15.885936Z"},"content_sha256":"26a5646c0dd3d888ddf0289e68f9ec5c665b46583384b542c186c7a2b20df764","schema_version":"1.0","event_id":"sha256:26a5646c0dd3d888ddf0289e68f9ec5c665b46583384b542c186c7a2b20df764"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:FE72TQI32JNQNDOZKBNAUNCTJW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Anti-Ramsey numbers of graphs with small connected components","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Shoni Gilboa, Yehuda Roditty","submitted_at":"2013-10-16T11:10:46Z","abstract_excerpt":"The anti-Ramsey number, $AR(n,G)$, for a graph $G$ and an integer $n\\geq|V(G)|$, is defined to be the minimal integer $r$ such that in any edge-colouring of $K_n$ by at least $r$ colours there is a multicoloured copy of $G$, namely, a copy of $G$ that each of its edges has a distinct colour. In this paper we determine, for large enough $n$, $AR(n,L\\cup tP_2)$ and $AR(n,L\\cup kP_3)$ for any large enough $t$ and $k$, and a graph $L$ satisfying some conditions. Consequently, we determine $AR(n,G)$, for large enough $n$, where $G$ is $P_3\\cup tP_2$ for any $t\\geq 3$, $P_4\\cup tP_2$ and $C_3\\cup tP"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.4331","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-18T00:44:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+XVULaMMqky8usrbrtK0mev8FZnyhvpPFKLXMIQNs6gFo0jA9nZjAe0958695YDDGnMWgydqpUgQgwf6KaYxBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:37:15.886285Z"},"content_sha256":"7e5194bc70075aa1e177a1919747bbe12ba6be2df40959f073f873f947bbf001","schema_version":"1.0","event_id":"sha256:7e5194bc70075aa1e177a1919747bbe12ba6be2df40959f073f873f947bbf001"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FE72TQI32JNQNDOZKBNAUNCTJW/bundle.json","state_url":"https://pith.science/pith/FE72TQI32JNQNDOZKBNAUNCTJW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FE72TQI32JNQNDOZKBNAUNCTJW/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-06-03T03:37:15Z","links":{"resolver":"https://pith.science/pith/FE72TQI32JNQNDOZKBNAUNCTJW","bundle":"https://pith.science/pith/FE72TQI32JNQNDOZKBNAUNCTJW/bundle.json","state":"https://pith.science/pith/FE72TQI32JNQNDOZKBNAUNCTJW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FE72TQI32JNQNDOZKBNAUNCTJW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:FE72TQI32JNQNDOZKBNAUNCTJW","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":"2f48a63e21a0c03bc760ebc9edad0e321cfde9d04ee1928464dec1b008be2b0f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-16T11:10:46Z","title_canon_sha256":"af97b1d3dec01f9ce6ab9963a00512612dd69f5290fceb08510ae71fb06cb5b0"},"schema_version":"1.0","source":{"id":"1310.4331","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.4331","created_at":"2026-05-18T00:44:39Z"},{"alias_kind":"arxiv_version","alias_value":"1310.4331v1","created_at":"2026-05-18T00:44:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.4331","created_at":"2026-05-18T00:44:39Z"},{"alias_kind":"pith_short_12","alias_value":"FE72TQI32JNQ","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FE72TQI32JNQNDOZ","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FE72TQI3","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:7e5194bc70075aa1e177a1919747bbe12ba6be2df40959f073f873f947bbf001","target":"graph","created_at":"2026-05-18T00:44:39Z","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"},"paper":{"abstract_excerpt":"The anti-Ramsey number, $AR(n,G)$, for a graph $G$ and an integer $n\\geq|V(G)|$, is defined to be the minimal integer $r$ such that in any edge-colouring of $K_n$ by at least $r$ colours there is a multicoloured copy of $G$, namely, a copy of $G$ that each of its edges has a distinct colour. In this paper we determine, for large enough $n$, $AR(n,L\\cup tP_2)$ and $AR(n,L\\cup kP_3)$ for any large enough $t$ and $k$, and a graph $L$ satisfying some conditions. Consequently, we determine $AR(n,G)$, for large enough $n$, where $G$ is $P_3\\cup tP_2$ for any $t\\geq 3$, $P_4\\cup tP_2$ and $C_3\\cup tP","authors_text":"Shoni Gilboa, Yehuda Roditty","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-16T11:10:46Z","title":"Anti-Ramsey numbers of graphs with small connected components"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.4331","kind":"arxiv","version":1},"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:26a5646c0dd3d888ddf0289e68f9ec5c665b46583384b542c186c7a2b20df764","target":"record","created_at":"2026-05-18T00:44:39Z","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":"2f48a63e21a0c03bc760ebc9edad0e321cfde9d04ee1928464dec1b008be2b0f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-16T11:10:46Z","title_canon_sha256":"af97b1d3dec01f9ce6ab9963a00512612dd69f5290fceb08510ae71fb06cb5b0"},"schema_version":"1.0","source":{"id":"1310.4331","kind":"arxiv","version":1}},"canonical_sha256":"293fa9c11bd25b068dd9505a0a34534da4aa4f988533ad43579b9229649535fd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"293fa9c11bd25b068dd9505a0a34534da4aa4f988533ad43579b9229649535fd","first_computed_at":"2026-05-18T00:44:39.175745Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:39.175745Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LMoeA0zdMNzMtqiVC0jUJI7R/5YtdZrtym7TaybfwEX1UYVYdSyorJGjsk5/AsdEOwIHghlvTULnM47tfK76AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:39.176156Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.4331","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:26a5646c0dd3d888ddf0289e68f9ec5c665b46583384b542c186c7a2b20df764","sha256:7e5194bc70075aa1e177a1919747bbe12ba6be2df40959f073f873f947bbf001"],"state_sha256":"06c99359c1339624b2301dbfc74c860c9806af18beb018833d5ff8aeed7db0a7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XMUr9X5fq4yCctL/q92mVW7hMtFALJoZQK4Us0OY1YWPU6W8AKUE4MulgHOeAMIuk/iSvtBn8o/jDoRI0YeMDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T03:37:15.888280Z","bundle_sha256":"5da68c4eb5543ed1f5281616dd261dd10cabd00f4f5d48b155dc0821e6f77546"}}