{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:N4HTENO6NHXMPHG6SVMRU7VWFR","short_pith_number":"pith:N4HTENO6","schema_version":"1.0","canonical_sha256":"6f0f3235de69eec79cde95591a7eb62c6361adc7fcc93e5c6cb8b1ceadb0712c","source":{"kind":"arxiv","id":"1207.0572","version":1},"attestation_state":"computed","paper":{"title":"On the number of links in a linearly embedded $K_{3,3,1}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.GT","authors_text":"Elena Pavelescu, Ramin Naimi","submitted_at":"2012-07-03T05:04:01Z","abstract_excerpt":"We show there exists a linear embedding of $K_{3,3,1}$ with n nontrivial 2-component links if and only if n = 1, 2, 3, 4, or 5."},"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":"1207.0572","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2012-07-03T05:04:01Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"73927e3060e3356283daae3868f4a5d95b95760333318b56111255acacd4e70a","abstract_canon_sha256":"b6d20da21103e5bd81ae69f95c26c4ebf5310d9e9e7fe2f63a23691b52c0a55f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:57.716237Z","signature_b64":"vs1BYEiCY3ufJNEJ2CWK1Zz1Zu/gCf3NrYEZ/pTrur6XBEDWL9AY1qwFzdKJaZI5C2LC7buExiuCK8WSHqWNAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f0f3235de69eec79cde95591a7eb62c6361adc7fcc93e5c6cb8b1ceadb0712c","last_reissued_at":"2026-05-18T03:51:57.715392Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:57.715392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the number of links in a linearly embedded $K_{3,3,1}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.GT","authors_text":"Elena Pavelescu, Ramin Naimi","submitted_at":"2012-07-03T05:04:01Z","abstract_excerpt":"We show there exists a linear embedding of $K_{3,3,1}$ with n nontrivial 2-component links if and only if n = 1, 2, 3, 4, or 5."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.0572","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":"1207.0572","created_at":"2026-05-18T03:51:57.715541+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.0572v1","created_at":"2026-05-18T03:51:57.715541+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0572","created_at":"2026-05-18T03:51:57.715541+00:00"},{"alias_kind":"pith_short_12","alias_value":"N4HTENO6NHXM","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"N4HTENO6NHXMPHG6","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"N4HTENO6","created_at":"2026-05-18T12:27:16.716162+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/N4HTENO6NHXMPHG6SVMRU7VWFR","json":"https://pith.science/pith/N4HTENO6NHXMPHG6SVMRU7VWFR.json","graph_json":"https://pith.science/api/pith-number/N4HTENO6NHXMPHG6SVMRU7VWFR/graph.json","events_json":"https://pith.science/api/pith-number/N4HTENO6NHXMPHG6SVMRU7VWFR/events.json","paper":"https://pith.science/paper/N4HTENO6"},"agent_actions":{"view_html":"https://pith.science/pith/N4HTENO6NHXMPHG6SVMRU7VWFR","download_json":"https://pith.science/pith/N4HTENO6NHXMPHG6SVMRU7VWFR.json","view_paper":"https://pith.science/paper/N4HTENO6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.0572&json=true","fetch_graph":"https://pith.science/api/pith-number/N4HTENO6NHXMPHG6SVMRU7VWFR/graph.json","fetch_events":"https://pith.science/api/pith-number/N4HTENO6NHXMPHG6SVMRU7VWFR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N4HTENO6NHXMPHG6SVMRU7VWFR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N4HTENO6NHXMPHG6SVMRU7VWFR/action/storage_attestation","attest_author":"https://pith.science/pith/N4HTENO6NHXMPHG6SVMRU7VWFR/action/author_attestation","sign_citation":"https://pith.science/pith/N4HTENO6NHXMPHG6SVMRU7VWFR/action/citation_signature","submit_replication":"https://pith.science/pith/N4HTENO6NHXMPHG6SVMRU7VWFR/action/replication_record"}},"created_at":"2026-05-18T03:51:57.715541+00:00","updated_at":"2026-05-18T03:51:57.715541+00:00"}