{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:BSFSVJJLOAZ4SRXYXUQ2PEJWJ7","short_pith_number":"pith:BSFSVJJL","schema_version":"1.0","canonical_sha256":"0c8b2aa52b7033c946f8bd21a791364fd43e3791b32d29000a1a6bedd66f8089","source":{"kind":"arxiv","id":"0712.1884","version":1},"attestation_state":"computed","paper":{"title":"A Criterion for Vertex Colorability of a Graph Stated in Terms of Edge Orientations","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Yu. V. Matiyasevich","submitted_at":"2007-12-12T09:27:48Z","abstract_excerpt":"L.M.Vitaver [1962] and G.I.Minty [1962] suggested criteria for vertex colorability of a graph in at most a given number of colors; these criteria are stated in terms of the orientation of the edges. One additional criterion of this kind is given 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":"0712.1884","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2007-12-12T09:27:48Z","cross_cats_sorted":[],"title_canon_sha256":"12554bece2588596902737b9b51cb4477232474856407df197de5cad143db984","abstract_canon_sha256":"1fee8e46afe36084566cc7909bcbedf02a235db6c889265cebf3cb628965c1f3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:06:13.775435Z","signature_b64":"mUrfWckIXqEyoMAiUa3qH+ZfDYZR1h07VEG8XjAjScYvv/UyoeuSBQVkDiAvfVkwnjpzjfN6XqHPLgrUb1oYBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c8b2aa52b7033c946f8bd21a791364fd43e3791b32d29000a1a6bedd66f8089","last_reissued_at":"2026-07-04T15:06:13.775007Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:06:13.775007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Criterion for Vertex Colorability of a Graph Stated in Terms of Edge Orientations","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Yu. V. Matiyasevich","submitted_at":"2007-12-12T09:27:48Z","abstract_excerpt":"L.M.Vitaver [1962] and G.I.Minty [1962] suggested criteria for vertex colorability of a graph in at most a given number of colors; these criteria are stated in terms of the orientation of the edges. One additional criterion of this kind is given here."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0712.1884","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0712.1884/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"0712.1884","created_at":"2026-07-04T15:06:13.775070+00:00"},{"alias_kind":"arxiv_version","alias_value":"0712.1884v1","created_at":"2026-07-04T15:06:13.775070+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0712.1884","created_at":"2026-07-04T15:06:13.775070+00:00"},{"alias_kind":"pith_short_12","alias_value":"BSFSVJJLOAZ4","created_at":"2026-07-04T15:06:13.775070+00:00"},{"alias_kind":"pith_short_16","alias_value":"BSFSVJJLOAZ4SRXY","created_at":"2026-07-04T15:06:13.775070+00:00"},{"alias_kind":"pith_short_8","alias_value":"BSFSVJJL","created_at":"2026-07-04T15:06:13.775070+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.15992","citing_title":"The Heawood approach to Tait colorings and defining vertex sets","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BSFSVJJLOAZ4SRXYXUQ2PEJWJ7","json":"https://pith.science/pith/BSFSVJJLOAZ4SRXYXUQ2PEJWJ7.json","graph_json":"https://pith.science/api/pith-number/BSFSVJJLOAZ4SRXYXUQ2PEJWJ7/graph.json","events_json":"https://pith.science/api/pith-number/BSFSVJJLOAZ4SRXYXUQ2PEJWJ7/events.json","paper":"https://pith.science/paper/BSFSVJJL"},"agent_actions":{"view_html":"https://pith.science/pith/BSFSVJJLOAZ4SRXYXUQ2PEJWJ7","download_json":"https://pith.science/pith/BSFSVJJLOAZ4SRXYXUQ2PEJWJ7.json","view_paper":"https://pith.science/paper/BSFSVJJL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0712.1884&json=true","fetch_graph":"https://pith.science/api/pith-number/BSFSVJJLOAZ4SRXYXUQ2PEJWJ7/graph.json","fetch_events":"https://pith.science/api/pith-number/BSFSVJJLOAZ4SRXYXUQ2PEJWJ7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BSFSVJJLOAZ4SRXYXUQ2PEJWJ7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BSFSVJJLOAZ4SRXYXUQ2PEJWJ7/action/storage_attestation","attest_author":"https://pith.science/pith/BSFSVJJLOAZ4SRXYXUQ2PEJWJ7/action/author_attestation","sign_citation":"https://pith.science/pith/BSFSVJJLOAZ4SRXYXUQ2PEJWJ7/action/citation_signature","submit_replication":"https://pith.science/pith/BSFSVJJLOAZ4SRXYXUQ2PEJWJ7/action/replication_record"}},"created_at":"2026-07-04T15:06:13.775070+00:00","updated_at":"2026-07-04T15:06:13.775070+00:00"}