{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:OW3B2QGR6WD65UZVC3A5BFY27L","short_pith_number":"pith:OW3B2QGR","schema_version":"1.0","canonical_sha256":"75b61d40d1f587eed33516c1d0971afac0fa726c3bb0021feb78a3c06d573351","source":{"kind":"arxiv","id":"1507.00593","version":4},"attestation_state":"computed","paper":{"title":"Notes on a theorem of Naji","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lorenzo Traldi","submitted_at":"2015-07-02T14:14:37Z","abstract_excerpt":"We present a new proof of an algebraic characterization of circle graphs due to W. Naji. For bipartite graphs, Naji's theorem is equivalent to an algebraic characterization of planar matroids due to J. Geelen and B. Gerards. Naji's theorem also yields an algebraic characterization of permutation 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":"1507.00593","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-02T14:14:37Z","cross_cats_sorted":[],"title_canon_sha256":"6086e3c6db7688ad92fab1caa815d957ab303f499fafc26d7ba3936453d10a7c","abstract_canon_sha256":"f6ba6c07f791e1899ab147b0e793fc27534a72d8536ca9f22f3797ba20fb642a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:24.963117Z","signature_b64":"NuM6ki/m6dqxK1PK5tM1armsEUbBe5v/lGnAB9T4IE0LYVriTtKwQNciUgkFAbwanO+qVCbBpZXyPjlf/n1EBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75b61d40d1f587eed33516c1d0971afac0fa726c3bb0021feb78a3c06d573351","last_reissued_at":"2026-05-18T00:34:24.962680Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:24.962680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Notes on a theorem of Naji","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lorenzo Traldi","submitted_at":"2015-07-02T14:14:37Z","abstract_excerpt":"We present a new proof of an algebraic characterization of circle graphs due to W. Naji. For bipartite graphs, Naji's theorem is equivalent to an algebraic characterization of planar matroids due to J. Geelen and B. Gerards. Naji's theorem also yields an algebraic characterization of permutation graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.00593","kind":"arxiv","version":4},"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":"1507.00593","created_at":"2026-05-18T00:34:24.962748+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.00593v4","created_at":"2026-05-18T00:34:24.962748+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.00593","created_at":"2026-05-18T00:34:24.962748+00:00"},{"alias_kind":"pith_short_12","alias_value":"OW3B2QGR6WD6","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"OW3B2QGR6WD65UZV","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"OW3B2QGR","created_at":"2026-05-18T12:29:34.919912+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/OW3B2QGR6WD65UZVC3A5BFY27L","json":"https://pith.science/pith/OW3B2QGR6WD65UZVC3A5BFY27L.json","graph_json":"https://pith.science/api/pith-number/OW3B2QGR6WD65UZVC3A5BFY27L/graph.json","events_json":"https://pith.science/api/pith-number/OW3B2QGR6WD65UZVC3A5BFY27L/events.json","paper":"https://pith.science/paper/OW3B2QGR"},"agent_actions":{"view_html":"https://pith.science/pith/OW3B2QGR6WD65UZVC3A5BFY27L","download_json":"https://pith.science/pith/OW3B2QGR6WD65UZVC3A5BFY27L.json","view_paper":"https://pith.science/paper/OW3B2QGR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.00593&json=true","fetch_graph":"https://pith.science/api/pith-number/OW3B2QGR6WD65UZVC3A5BFY27L/graph.json","fetch_events":"https://pith.science/api/pith-number/OW3B2QGR6WD65UZVC3A5BFY27L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OW3B2QGR6WD65UZVC3A5BFY27L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OW3B2QGR6WD65UZVC3A5BFY27L/action/storage_attestation","attest_author":"https://pith.science/pith/OW3B2QGR6WD65UZVC3A5BFY27L/action/author_attestation","sign_citation":"https://pith.science/pith/OW3B2QGR6WD65UZVC3A5BFY27L/action/citation_signature","submit_replication":"https://pith.science/pith/OW3B2QGR6WD65UZVC3A5BFY27L/action/replication_record"}},"created_at":"2026-05-18T00:34:24.962748+00:00","updated_at":"2026-05-18T00:34:24.962748+00:00"}