{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:MN5HV26I2G4GWQJK32PI2I6CIC","short_pith_number":"pith:MN5HV26I","schema_version":"1.0","canonical_sha256":"637a7aebc8d1b86b412ade9e8d23c240a7cc17fd4d131166830414c8c3b0f030","source":{"kind":"arxiv","id":"1303.4673","version":1},"attestation_state":"computed","paper":{"title":"Geometric achromatic and pseudoachromatic indices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"C. Rubio-Montiel, D. Lara, G. Araujo-Pardo, J. Urrutia, N. Garc\\'ia-Col\\'in, O. Aichholzer, T. Hackl","submitted_at":"2013-03-19T17:46:51Z","abstract_excerpt":"The pseudoachromatic index of a graph is the maximum number of colors that can be assigned to its edges, such that each pair of different colors is incident to a common vertex. If for each vertex its incident edges have different color, then this maximum is known as achromatic index. Both indices have been widely studied. A geometric graph is a graph drawn in the plane such that its vertices are points in general position, and its edges are straight-line segments. In this paper we extend the notion of pseudoachromatic and achromatic indices for geometric graphs, and present results for complet"},"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":"1303.4673","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-19T17:46:51Z","cross_cats_sorted":[],"title_canon_sha256":"89aebf539379fbcaf51afd75f1038becd1138429b99546da2be1255e276032b6","abstract_canon_sha256":"ba6a1dbae10460e3f0b459c0eb7f3a0a247410c6f3f87660b05fd54c4c1ea0e7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:00.967285Z","signature_b64":"1NfAiI8Uo3+4HHIbawCzRriPRQoiPSJfmJe8Bh6l/5sYaf/YBP3BuciIM++YKRu6hoQrQHLQyYrd6ap4gEQ/Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"637a7aebc8d1b86b412ade9e8d23c240a7cc17fd4d131166830414c8c3b0f030","last_reissued_at":"2026-05-18T00:05:00.966709Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:00.966709Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Geometric achromatic and pseudoachromatic indices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"C. Rubio-Montiel, D. Lara, G. Araujo-Pardo, J. Urrutia, N. Garc\\'ia-Col\\'in, O. Aichholzer, T. Hackl","submitted_at":"2013-03-19T17:46:51Z","abstract_excerpt":"The pseudoachromatic index of a graph is the maximum number of colors that can be assigned to its edges, such that each pair of different colors is incident to a common vertex. If for each vertex its incident edges have different color, then this maximum is known as achromatic index. Both indices have been widely studied. A geometric graph is a graph drawn in the plane such that its vertices are points in general position, and its edges are straight-line segments. In this paper we extend the notion of pseudoachromatic and achromatic indices for geometric graphs, and present results for complet"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.4673","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":"1303.4673","created_at":"2026-05-18T00:05:00.966784+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.4673v1","created_at":"2026-05-18T00:05:00.966784+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.4673","created_at":"2026-05-18T00:05:00.966784+00:00"},{"alias_kind":"pith_short_12","alias_value":"MN5HV26I2G4G","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"MN5HV26I2G4GWQJK","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"MN5HV26I","created_at":"2026-05-18T12:27:52.871228+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/MN5HV26I2G4GWQJK32PI2I6CIC","json":"https://pith.science/pith/MN5HV26I2G4GWQJK32PI2I6CIC.json","graph_json":"https://pith.science/api/pith-number/MN5HV26I2G4GWQJK32PI2I6CIC/graph.json","events_json":"https://pith.science/api/pith-number/MN5HV26I2G4GWQJK32PI2I6CIC/events.json","paper":"https://pith.science/paper/MN5HV26I"},"agent_actions":{"view_html":"https://pith.science/pith/MN5HV26I2G4GWQJK32PI2I6CIC","download_json":"https://pith.science/pith/MN5HV26I2G4GWQJK32PI2I6CIC.json","view_paper":"https://pith.science/paper/MN5HV26I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.4673&json=true","fetch_graph":"https://pith.science/api/pith-number/MN5HV26I2G4GWQJK32PI2I6CIC/graph.json","fetch_events":"https://pith.science/api/pith-number/MN5HV26I2G4GWQJK32PI2I6CIC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MN5HV26I2G4GWQJK32PI2I6CIC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MN5HV26I2G4GWQJK32PI2I6CIC/action/storage_attestation","attest_author":"https://pith.science/pith/MN5HV26I2G4GWQJK32PI2I6CIC/action/author_attestation","sign_citation":"https://pith.science/pith/MN5HV26I2G4GWQJK32PI2I6CIC/action/citation_signature","submit_replication":"https://pith.science/pith/MN5HV26I2G4GWQJK32PI2I6CIC/action/replication_record"}},"created_at":"2026-05-18T00:05:00.966784+00:00","updated_at":"2026-05-18T00:05:00.966784+00:00"}