{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:TDMXS5HCPPMBHEGRUVUV43KDLO","short_pith_number":"pith:TDMXS5HC","schema_version":"1.0","canonical_sha256":"98d97974e27bd81390d1a5695e6d435b88ff354c0f34f0a773e20d0862c54351","source":{"kind":"arxiv","id":"1204.0660","version":1},"attestation_state":"computed","paper":{"title":"Hardness of approximation for crossing number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.CO"],"primary_cat":"cs.CG","authors_text":"Sergio Cabello","submitted_at":"2012-04-03T11:32:13Z","abstract_excerpt":"We show that, if P\\not=NP, there is a constant c > 1 such that there is no c-approximation algorithm for the crossing number, even when restricted to 3-regular graphs."},"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":"1204.0660","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-04-03T11:32:13Z","cross_cats_sorted":["cs.CC","math.CO"],"title_canon_sha256":"78fec724b4947a540164167bd93a09efa0fb9c4368a21f67f8a69da80ef3b1c2","abstract_canon_sha256":"c501bafa6569118f04504b22c1e60db6c6ca471329f24798005ebbc114c0219b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:58:38.849009Z","signature_b64":"YIhJBGv09K1KIc0PoBZpl8LJaYUruoU9Fko76ndymx9umfqV80xXD/zVAtsNYidWHlOxVn3YC7xaAndNftHnDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98d97974e27bd81390d1a5695e6d435b88ff354c0f34f0a773e20d0862c54351","last_reissued_at":"2026-05-18T03:58:38.848228Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:58:38.848228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hardness of approximation for crossing number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.CO"],"primary_cat":"cs.CG","authors_text":"Sergio Cabello","submitted_at":"2012-04-03T11:32:13Z","abstract_excerpt":"We show that, if P\\not=NP, there is a constant c > 1 such that there is no c-approximation algorithm for the crossing number, even when restricted to 3-regular graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.0660","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":"1204.0660","created_at":"2026-05-18T03:58:38.848355+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.0660v1","created_at":"2026-05-18T03:58:38.848355+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.0660","created_at":"2026-05-18T03:58:38.848355+00:00"},{"alias_kind":"pith_short_12","alias_value":"TDMXS5HCPPMB","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"TDMXS5HCPPMBHEGR","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"TDMXS5HC","created_at":"2026-05-18T12:27:23.164592+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/TDMXS5HCPPMBHEGRUVUV43KDLO","json":"https://pith.science/pith/TDMXS5HCPPMBHEGRUVUV43KDLO.json","graph_json":"https://pith.science/api/pith-number/TDMXS5HCPPMBHEGRUVUV43KDLO/graph.json","events_json":"https://pith.science/api/pith-number/TDMXS5HCPPMBHEGRUVUV43KDLO/events.json","paper":"https://pith.science/paper/TDMXS5HC"},"agent_actions":{"view_html":"https://pith.science/pith/TDMXS5HCPPMBHEGRUVUV43KDLO","download_json":"https://pith.science/pith/TDMXS5HCPPMBHEGRUVUV43KDLO.json","view_paper":"https://pith.science/paper/TDMXS5HC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.0660&json=true","fetch_graph":"https://pith.science/api/pith-number/TDMXS5HCPPMBHEGRUVUV43KDLO/graph.json","fetch_events":"https://pith.science/api/pith-number/TDMXS5HCPPMBHEGRUVUV43KDLO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TDMXS5HCPPMBHEGRUVUV43KDLO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TDMXS5HCPPMBHEGRUVUV43KDLO/action/storage_attestation","attest_author":"https://pith.science/pith/TDMXS5HCPPMBHEGRUVUV43KDLO/action/author_attestation","sign_citation":"https://pith.science/pith/TDMXS5HCPPMBHEGRUVUV43KDLO/action/citation_signature","submit_replication":"https://pith.science/pith/TDMXS5HCPPMBHEGRUVUV43KDLO/action/replication_record"}},"created_at":"2026-05-18T03:58:38.848355+00:00","updated_at":"2026-05-18T03:58:38.848355+00:00"}