{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:HQO7FKOJPKRYFSXTYIT6OJSOPH","short_pith_number":"pith:HQO7FKOJ","schema_version":"1.0","canonical_sha256":"3c1df2a9c97aa382caf3c227e7264e79e22649adffb6b12403321845663ef63a","source":{"kind":"arxiv","id":"1405.5117","version":1},"attestation_state":"computed","paper":{"title":"Crossing numbers of periodic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bojan Mohar, Zdenek Dvorak","submitted_at":"2014-05-20T15:18:54Z","abstract_excerpt":"A graph is periodic if it can be obtained by joining identical pieces in a cyclic fashion. It is shown that the limit crossing number of a periodic graph is computable. This answers a question of Benny Pinontoan and Bruce Richter (2004)."},"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":"1405.5117","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-20T15:18:54Z","cross_cats_sorted":[],"title_canon_sha256":"86c20d69c55683a89486a1d37606c6697d35bbe0ba08b7499f9526c939a0e275","abstract_canon_sha256":"787fb6a2b4cd02f977e8358739b27cc5397497fb5af39092e24a7b9403ba16c8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:32.059989Z","signature_b64":"NnyA7pCk/3Ee2k7soBv9gaTpEwEaIG9KSX067JnJnqsme3oXwVJI952mQSGeIhIzXlDqXD18YfKHvEFb/iDpCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c1df2a9c97aa382caf3c227e7264e79e22649adffb6b12403321845663ef63a","last_reissued_at":"2026-05-18T02:51:32.059433Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:32.059433Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Crossing numbers of periodic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bojan Mohar, Zdenek Dvorak","submitted_at":"2014-05-20T15:18:54Z","abstract_excerpt":"A graph is periodic if it can be obtained by joining identical pieces in a cyclic fashion. It is shown that the limit crossing number of a periodic graph is computable. This answers a question of Benny Pinontoan and Bruce Richter (2004)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.5117","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":"1405.5117","created_at":"2026-05-18T02:51:32.059522+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.5117v1","created_at":"2026-05-18T02:51:32.059522+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.5117","created_at":"2026-05-18T02:51:32.059522+00:00"},{"alias_kind":"pith_short_12","alias_value":"HQO7FKOJPKRY","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"HQO7FKOJPKRYFSXT","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"HQO7FKOJ","created_at":"2026-05-18T12:28:30.664211+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/HQO7FKOJPKRYFSXTYIT6OJSOPH","json":"https://pith.science/pith/HQO7FKOJPKRYFSXTYIT6OJSOPH.json","graph_json":"https://pith.science/api/pith-number/HQO7FKOJPKRYFSXTYIT6OJSOPH/graph.json","events_json":"https://pith.science/api/pith-number/HQO7FKOJPKRYFSXTYIT6OJSOPH/events.json","paper":"https://pith.science/paper/HQO7FKOJ"},"agent_actions":{"view_html":"https://pith.science/pith/HQO7FKOJPKRYFSXTYIT6OJSOPH","download_json":"https://pith.science/pith/HQO7FKOJPKRYFSXTYIT6OJSOPH.json","view_paper":"https://pith.science/paper/HQO7FKOJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.5117&json=true","fetch_graph":"https://pith.science/api/pith-number/HQO7FKOJPKRYFSXTYIT6OJSOPH/graph.json","fetch_events":"https://pith.science/api/pith-number/HQO7FKOJPKRYFSXTYIT6OJSOPH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HQO7FKOJPKRYFSXTYIT6OJSOPH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HQO7FKOJPKRYFSXTYIT6OJSOPH/action/storage_attestation","attest_author":"https://pith.science/pith/HQO7FKOJPKRYFSXTYIT6OJSOPH/action/author_attestation","sign_citation":"https://pith.science/pith/HQO7FKOJPKRYFSXTYIT6OJSOPH/action/citation_signature","submit_replication":"https://pith.science/pith/HQO7FKOJPKRYFSXTYIT6OJSOPH/action/replication_record"}},"created_at":"2026-05-18T02:51:32.059522+00:00","updated_at":"2026-05-18T02:51:32.059522+00:00"}