{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:AMSR6PXI4MWLYM5PLS3K7YV6CO","short_pith_number":"pith:AMSR6PXI","canonical_record":{"source":{"id":"1305.2009","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-09T04:43:48Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"b7bc6c97518dd1c185986171ccb1f41917f0af7e6d2f8fc56620d3587bbe75e4","abstract_canon_sha256":"0e8b2e75cbd0d09133058498fdf0a3b233f88e24e97b74e0ab10f99af9e70287"},"schema_version":"1.0"},"canonical_sha256":"03251f3ee8e32cbc33af5cb6afe2be13b8c792a13169dc7e0095db601fde1b99","source":{"kind":"arxiv","id":"1305.2009","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.2009","created_at":"2026-05-18T03:15:43Z"},{"alias_kind":"arxiv_version","alias_value":"1305.2009v2","created_at":"2026-05-18T03:15:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.2009","created_at":"2026-05-18T03:15:43Z"},{"alias_kind":"pith_short_12","alias_value":"AMSR6PXI4MWL","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"AMSR6PXI4MWLYM5P","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"AMSR6PXI","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:AMSR6PXI4MWLYM5PLS3K7YV6CO","target":"record","payload":{"canonical_record":{"source":{"id":"1305.2009","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-09T04:43:48Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"b7bc6c97518dd1c185986171ccb1f41917f0af7e6d2f8fc56620d3587bbe75e4","abstract_canon_sha256":"0e8b2e75cbd0d09133058498fdf0a3b233f88e24e97b74e0ab10f99af9e70287"},"schema_version":"1.0"},"canonical_sha256":"03251f3ee8e32cbc33af5cb6afe2be13b8c792a13169dc7e0095db601fde1b99","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:43.180268Z","signature_b64":"8nq95HAt3AWmBHbTkFOxL74cpt3cwGKyzDL4gJZ0kKduvWcgnc0scQtiZY+ix8N0TwRMzn18QWmBOjqVl7fYCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03251f3ee8e32cbc33af5cb6afe2be13b8c792a13169dc7e0095db601fde1b99","last_reissued_at":"2026-05-18T03:15:43.179777Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:43.179777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.2009","source_version":2,"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-18T03:15:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sg12nuXactKyLtthRLJs7Uo6UsalVDFUcuXq0hARTcsDhSGo38yz8+FG3zGanq/tAQq7lnQfKVA1+4LFR48ECA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T13:29:24.279410Z"},"content_sha256":"6454ddc5d7b845839fae7b9d454a8b0a1de07cdbd41c0293d62fbd1c53327103","schema_version":"1.0","event_id":"sha256:6454ddc5d7b845839fae7b9d454a8b0a1de07cdbd41c0293d62fbd1c53327103"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:AMSR6PXI4MWLYM5PLS3K7YV6CO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Strong chromatic index of chordless graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Manu Basavaraju, Mathew C. Francis","submitted_at":"2013-05-09T04:43:48Z","abstract_excerpt":"A strong edge colouring of a graph is an assignment of colours to the edges of the graph such that for every colour, the set of edges that are given that colour form an induced matching in the graph. The strong chromatic index of a graph $G$, denoted by $\\chi'_s(G)$, is the minimum number of colours needed in any strong edge colouring of $G$. A graph is said to be \\emph{chordless} if there is no cycle in the graph that has a chord. Faudree, Gy\\'arf\\'as, Schelp and Tuza~[The Strong Chromatic Index of Graphs, Ars Combin., 29B (1990), pp.~205--211] considered a particular subclass of chordless gr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.2009","kind":"arxiv","version":2},"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-18T03:15:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2jbQbSJ5oa7borzS7k3WEedomOv9y5kYCaM+a1YtIM2YfMwzyNa8Q5bDuR/G87tWTjAk6zZCwGJ31hLQ1pk8CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T13:29:24.279753Z"},"content_sha256":"11b9c14b65d441e72b350d437fd13f39dd41bfe3f5b0bbe9666705529e34cc75","schema_version":"1.0","event_id":"sha256:11b9c14b65d441e72b350d437fd13f39dd41bfe3f5b0bbe9666705529e34cc75"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AMSR6PXI4MWLYM5PLS3K7YV6CO/bundle.json","state_url":"https://pith.science/pith/AMSR6PXI4MWLYM5PLS3K7YV6CO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AMSR6PXI4MWLYM5PLS3K7YV6CO/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-28T13:29:24Z","links":{"resolver":"https://pith.science/pith/AMSR6PXI4MWLYM5PLS3K7YV6CO","bundle":"https://pith.science/pith/AMSR6PXI4MWLYM5PLS3K7YV6CO/bundle.json","state":"https://pith.science/pith/AMSR6PXI4MWLYM5PLS3K7YV6CO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AMSR6PXI4MWLYM5PLS3K7YV6CO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:AMSR6PXI4MWLYM5PLS3K7YV6CO","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":"0e8b2e75cbd0d09133058498fdf0a3b233f88e24e97b74e0ab10f99af9e70287","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-09T04:43:48Z","title_canon_sha256":"b7bc6c97518dd1c185986171ccb1f41917f0af7e6d2f8fc56620d3587bbe75e4"},"schema_version":"1.0","source":{"id":"1305.2009","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.2009","created_at":"2026-05-18T03:15:43Z"},{"alias_kind":"arxiv_version","alias_value":"1305.2009v2","created_at":"2026-05-18T03:15:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.2009","created_at":"2026-05-18T03:15:43Z"},{"alias_kind":"pith_short_12","alias_value":"AMSR6PXI4MWL","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"AMSR6PXI4MWLYM5P","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"AMSR6PXI","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:11b9c14b65d441e72b350d437fd13f39dd41bfe3f5b0bbe9666705529e34cc75","target":"graph","created_at":"2026-05-18T03:15:43Z","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":"A strong edge colouring of a graph is an assignment of colours to the edges of the graph such that for every colour, the set of edges that are given that colour form an induced matching in the graph. The strong chromatic index of a graph $G$, denoted by $\\chi'_s(G)$, is the minimum number of colours needed in any strong edge colouring of $G$. A graph is said to be \\emph{chordless} if there is no cycle in the graph that has a chord. Faudree, Gy\\'arf\\'as, Schelp and Tuza~[The Strong Chromatic Index of Graphs, Ars Combin., 29B (1990), pp.~205--211] considered a particular subclass of chordless gr","authors_text":"Manu Basavaraju, Mathew C. Francis","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-09T04:43:48Z","title":"Strong chromatic index of chordless graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.2009","kind":"arxiv","version":2},"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:6454ddc5d7b845839fae7b9d454a8b0a1de07cdbd41c0293d62fbd1c53327103","target":"record","created_at":"2026-05-18T03:15:43Z","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":"0e8b2e75cbd0d09133058498fdf0a3b233f88e24e97b74e0ab10f99af9e70287","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-09T04:43:48Z","title_canon_sha256":"b7bc6c97518dd1c185986171ccb1f41917f0af7e6d2f8fc56620d3587bbe75e4"},"schema_version":"1.0","source":{"id":"1305.2009","kind":"arxiv","version":2}},"canonical_sha256":"03251f3ee8e32cbc33af5cb6afe2be13b8c792a13169dc7e0095db601fde1b99","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"03251f3ee8e32cbc33af5cb6afe2be13b8c792a13169dc7e0095db601fde1b99","first_computed_at":"2026-05-18T03:15:43.179777Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:15:43.179777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8nq95HAt3AWmBHbTkFOxL74cpt3cwGKyzDL4gJZ0kKduvWcgnc0scQtiZY+ix8N0TwRMzn18QWmBOjqVl7fYCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:15:43.180268Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.2009","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6454ddc5d7b845839fae7b9d454a8b0a1de07cdbd41c0293d62fbd1c53327103","sha256:11b9c14b65d441e72b350d437fd13f39dd41bfe3f5b0bbe9666705529e34cc75"],"state_sha256":"584a99cbc5644f3db6d3532b7f373db1165990fbc8f38e7c7980a7f4700617ee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cKYfFIFXp2eQLYo4O8Qb36/Qy7o/xkn2ayp9Q0i1LswkVfhHuwF58YEjjMXBZGuSXz7D+a5L5iP79iJlhw1KDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T13:29:24.281664Z","bundle_sha256":"bbfe5b7cb4278bcc6f129b764fe334080ee6ba0c8bf967d7b8dc01443eabd3f6"}}