{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:C2S2MJXXWSBNIPZRVQJULGQIW2","short_pith_number":"pith:C2S2MJXX","schema_version":"1.0","canonical_sha256":"16a5a626f7b482d43f31ac13459a08b6a0f877d0bfe22591c63c9b289944e47d","source":{"kind":"arxiv","id":"1507.06800","version":2},"attestation_state":"computed","paper":{"title":"The Characterization of planar, 4-connected, K_{2,5}-minor-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Emily Abernethy Marshall, Liana Yepremyan, Zach Gaslowitz","submitted_at":"2015-07-24T10:25:44Z","abstract_excerpt":"We show that every planar, 4-connected, K2;5-minor- free graph is the square of a cycle of even length at least six."},"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.06800","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-24T10:25:44Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"199bcbaefeb6c48a18eae2b37ecf794691aa4bfc67d42c66c839d224cb14022b","abstract_canon_sha256":"20ce8354e0eaa208825a625b384e885d9864f2b6ca51b4e2f9f57b6b29f955c9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:56.856523Z","signature_b64":"FU1Jb5jaQ5AN9Yin8rVPb7uGJIWQT9BjOe0KGe0dIrE8PH3CApEIkvXBhIeVHiYLE5wuxwTdDHqZQ6vf36ueAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"16a5a626f7b482d43f31ac13459a08b6a0f877d0bfe22591c63c9b289944e47d","last_reissued_at":"2026-05-18T01:34:56.855871Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:56.855871Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Characterization of planar, 4-connected, K_{2,5}-minor-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Emily Abernethy Marshall, Liana Yepremyan, Zach Gaslowitz","submitted_at":"2015-07-24T10:25:44Z","abstract_excerpt":"We show that every planar, 4-connected, K2;5-minor- free graph is the square of a cycle of even length at least six."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.06800","kind":"arxiv","version":2},"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.06800","created_at":"2026-05-18T01:34:56.855950+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.06800v2","created_at":"2026-05-18T01:34:56.855950+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.06800","created_at":"2026-05-18T01:34:56.855950+00:00"},{"alias_kind":"pith_short_12","alias_value":"C2S2MJXXWSBN","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"C2S2MJXXWSBNIPZR","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"C2S2MJXX","created_at":"2026-05-18T12:29:14.074870+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/C2S2MJXXWSBNIPZRVQJULGQIW2","json":"https://pith.science/pith/C2S2MJXXWSBNIPZRVQJULGQIW2.json","graph_json":"https://pith.science/api/pith-number/C2S2MJXXWSBNIPZRVQJULGQIW2/graph.json","events_json":"https://pith.science/api/pith-number/C2S2MJXXWSBNIPZRVQJULGQIW2/events.json","paper":"https://pith.science/paper/C2S2MJXX"},"agent_actions":{"view_html":"https://pith.science/pith/C2S2MJXXWSBNIPZRVQJULGQIW2","download_json":"https://pith.science/pith/C2S2MJXXWSBNIPZRVQJULGQIW2.json","view_paper":"https://pith.science/paper/C2S2MJXX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.06800&json=true","fetch_graph":"https://pith.science/api/pith-number/C2S2MJXXWSBNIPZRVQJULGQIW2/graph.json","fetch_events":"https://pith.science/api/pith-number/C2S2MJXXWSBNIPZRVQJULGQIW2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C2S2MJXXWSBNIPZRVQJULGQIW2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C2S2MJXXWSBNIPZRVQJULGQIW2/action/storage_attestation","attest_author":"https://pith.science/pith/C2S2MJXXWSBNIPZRVQJULGQIW2/action/author_attestation","sign_citation":"https://pith.science/pith/C2S2MJXXWSBNIPZRVQJULGQIW2/action/citation_signature","submit_replication":"https://pith.science/pith/C2S2MJXXWSBNIPZRVQJULGQIW2/action/replication_record"}},"created_at":"2026-05-18T01:34:56.855950+00:00","updated_at":"2026-05-18T01:34:56.855950+00:00"}