{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:AMSR6PXI4MWLYM5PLS3K7YV6CO","short_pith_number":"pith:AMSR6PXI","schema_version":"1.0","canonical_sha256":"03251f3ee8e32cbc33af5cb6afe2be13b8c792a13169dc7e0095db601fde1b99","source":{"kind":"arxiv","id":"1305.2009","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1305.2009","created_at":"2026-05-18T03:15:43.179856+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.2009v2","created_at":"2026-05-18T03:15:43.179856+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.2009","created_at":"2026-05-18T03:15:43.179856+00:00"},{"alias_kind":"pith_short_12","alias_value":"AMSR6PXI4MWL","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"AMSR6PXI4MWLYM5P","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"AMSR6PXI","created_at":"2026-05-18T12:27:38.830355+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/AMSR6PXI4MWLYM5PLS3K7YV6CO","json":"https://pith.science/pith/AMSR6PXI4MWLYM5PLS3K7YV6CO.json","graph_json":"https://pith.science/api/pith-number/AMSR6PXI4MWLYM5PLS3K7YV6CO/graph.json","events_json":"https://pith.science/api/pith-number/AMSR6PXI4MWLYM5PLS3K7YV6CO/events.json","paper":"https://pith.science/paper/AMSR6PXI"},"agent_actions":{"view_html":"https://pith.science/pith/AMSR6PXI4MWLYM5PLS3K7YV6CO","download_json":"https://pith.science/pith/AMSR6PXI4MWLYM5PLS3K7YV6CO.json","view_paper":"https://pith.science/paper/AMSR6PXI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.2009&json=true","fetch_graph":"https://pith.science/api/pith-number/AMSR6PXI4MWLYM5PLS3K7YV6CO/graph.json","fetch_events":"https://pith.science/api/pith-number/AMSR6PXI4MWLYM5PLS3K7YV6CO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AMSR6PXI4MWLYM5PLS3K7YV6CO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AMSR6PXI4MWLYM5PLS3K7YV6CO/action/storage_attestation","attest_author":"https://pith.science/pith/AMSR6PXI4MWLYM5PLS3K7YV6CO/action/author_attestation","sign_citation":"https://pith.science/pith/AMSR6PXI4MWLYM5PLS3K7YV6CO/action/citation_signature","submit_replication":"https://pith.science/pith/AMSR6PXI4MWLYM5PLS3K7YV6CO/action/replication_record"}},"created_at":"2026-05-18T03:15:43.179856+00:00","updated_at":"2026-05-18T03:15:43.179856+00:00"}