{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:HYJTD3ATLVRGAVRGXDISBIWUUP","short_pith_number":"pith:HYJTD3AT","schema_version":"1.0","canonical_sha256":"3e1331ec135d62605626b8d120a2d4a3fb2562034dc118ba25a7874d6bdcaa2e","source":{"kind":"arxiv","id":"1311.0539","version":1},"attestation_state":"computed","paper":{"title":"Online and size anti-Ramsey numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Judith Stumpp, Kolja Knauer, Maria Axenovich, Torsten Ueckerdt","submitted_at":"2013-11-03T22:59:14Z","abstract_excerpt":"A graph is properly edge-colored if no two adjacent edges have the same color. The smallest number of edges in a graph any of whose proper edge colorings contains a totally multicolored copy of a graph H is the size anti-Ramsey number AR_s(H) of H. This number in offline and online setting is investigated here."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1311.0539","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-03T22:59:14Z","cross_cats_sorted":[],"title_canon_sha256":"9aeec7a687ba71ad9daacc14e2db7ad7fd9dbe933631ac004afea0201d880c2a","abstract_canon_sha256":"d6925f073d67b83870826c182ce5e0a11ef9a2a928c22ce45913bfe243a0e04f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:08:05.562282Z","signature_b64":"MJS/BKqfyz/uvCor5CDKYIobI+OPvPhu/wrqVxCTGrZUXciNcD/svpsRDy5nNYGQiUKN3PIufPgvAlZnIHleDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e1331ec135d62605626b8d120a2d4a3fb2562034dc118ba25a7874d6bdcaa2e","last_reissued_at":"2026-05-18T03:08:05.561779Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:08:05.561779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online and size anti-Ramsey numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Judith Stumpp, Kolja Knauer, Maria Axenovich, Torsten Ueckerdt","submitted_at":"2013-11-03T22:59:14Z","abstract_excerpt":"A graph is properly edge-colored if no two adjacent edges have the same color. The smallest number of edges in a graph any of whose proper edge colorings contains a totally multicolored copy of a graph H is the size anti-Ramsey number AR_s(H) of H. This number in offline and online setting is investigated here."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.0539","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1311.0539","created_at":"2026-05-18T03:08:05.561848+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.0539v1","created_at":"2026-05-18T03:08:05.561848+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.0539","created_at":"2026-05-18T03:08:05.561848+00:00"},{"alias_kind":"pith_short_12","alias_value":"HYJTD3ATLVRG","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"HYJTD3ATLVRGAVRG","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"HYJTD3AT","created_at":"2026-05-18T12:27:46.883200+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HYJTD3ATLVRGAVRGXDISBIWUUP","json":"https://pith.science/pith/HYJTD3ATLVRGAVRGXDISBIWUUP.json","graph_json":"https://pith.science/api/pith-number/HYJTD3ATLVRGAVRGXDISBIWUUP/graph.json","events_json":"https://pith.science/api/pith-number/HYJTD3ATLVRGAVRGXDISBIWUUP/events.json","paper":"https://pith.science/paper/HYJTD3AT"},"agent_actions":{"view_html":"https://pith.science/pith/HYJTD3ATLVRGAVRGXDISBIWUUP","download_json":"https://pith.science/pith/HYJTD3ATLVRGAVRGXDISBIWUUP.json","view_paper":"https://pith.science/paper/HYJTD3AT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.0539&json=true","fetch_graph":"https://pith.science/api/pith-number/HYJTD3ATLVRGAVRGXDISBIWUUP/graph.json","fetch_events":"https://pith.science/api/pith-number/HYJTD3ATLVRGAVRGXDISBIWUUP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HYJTD3ATLVRGAVRGXDISBIWUUP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HYJTD3ATLVRGAVRGXDISBIWUUP/action/storage_attestation","attest_author":"https://pith.science/pith/HYJTD3ATLVRGAVRGXDISBIWUUP/action/author_attestation","sign_citation":"https://pith.science/pith/HYJTD3ATLVRGAVRGXDISBIWUUP/action/citation_signature","submit_replication":"https://pith.science/pith/HYJTD3ATLVRGAVRGXDISBIWUUP/action/replication_record"}},"created_at":"2026-05-18T03:08:05.561848+00:00","updated_at":"2026-05-18T03:08:05.561848+00:00"}