{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:PAP4DF3TQUB5GGCWRTE4XL6UUD","short_pith_number":"pith:PAP4DF3T","schema_version":"1.0","canonical_sha256":"781fc197738503d318568cc9cbafd4a0e1ba9d2857fa7b505df0c8c146e49fe6","source":{"kind":"arxiv","id":"1408.6815","version":2},"attestation_state":"computed","paper":{"title":"On the Component Number of Links from Plane Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GT"],"primary_cat":"math.CO","authors_text":"Daniel S. Silver, Susan G. Williams","submitted_at":"2014-08-28T19:20:10Z","abstract_excerpt":"A short, elementary proof is given of the result: The number of components of a link arising from a medial graph M(G) by resolving vertices is equal to the nullity of the mod-2 Laplacian matrix of the graph G."},"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":"1408.6815","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-28T19:20:10Z","cross_cats_sorted":["math.GT"],"title_canon_sha256":"3ba833c7a194143b3fb973bdd7adc7391bfff6639d60bca445ad02401833e68a","abstract_canon_sha256":"0805a6c93177f1124cf70fe82c0c8bfe314b9937db9fad736838daa6f488c841"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:37:44.314006Z","signature_b64":"p5KdCc+35lht7TFu1aQV4nYYHmiaWOJfbNBJbzzoCm8gcERwtQPa5p7WdjyIcAv+nLJoOqHnGg27ukFtJB4lAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"781fc197738503d318568cc9cbafd4a0e1ba9d2857fa7b505df0c8c146e49fe6","last_reissued_at":"2026-05-18T02:37:44.313506Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:37:44.313506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Component Number of Links from Plane Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GT"],"primary_cat":"math.CO","authors_text":"Daniel S. Silver, Susan G. Williams","submitted_at":"2014-08-28T19:20:10Z","abstract_excerpt":"A short, elementary proof is given of the result: The number of components of a link arising from a medial graph M(G) by resolving vertices is equal to the nullity of the mod-2 Laplacian matrix of the graph G."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.6815","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":"1408.6815","created_at":"2026-05-18T02:37:44.313577+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.6815v2","created_at":"2026-05-18T02:37:44.313577+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.6815","created_at":"2026-05-18T02:37:44.313577+00:00"},{"alias_kind":"pith_short_12","alias_value":"PAP4DF3TQUB5","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"PAP4DF3TQUB5GGCW","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"PAP4DF3T","created_at":"2026-05-18T12:28:43.426989+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/PAP4DF3TQUB5GGCWRTE4XL6UUD","json":"https://pith.science/pith/PAP4DF3TQUB5GGCWRTE4XL6UUD.json","graph_json":"https://pith.science/api/pith-number/PAP4DF3TQUB5GGCWRTE4XL6UUD/graph.json","events_json":"https://pith.science/api/pith-number/PAP4DF3TQUB5GGCWRTE4XL6UUD/events.json","paper":"https://pith.science/paper/PAP4DF3T"},"agent_actions":{"view_html":"https://pith.science/pith/PAP4DF3TQUB5GGCWRTE4XL6UUD","download_json":"https://pith.science/pith/PAP4DF3TQUB5GGCWRTE4XL6UUD.json","view_paper":"https://pith.science/paper/PAP4DF3T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.6815&json=true","fetch_graph":"https://pith.science/api/pith-number/PAP4DF3TQUB5GGCWRTE4XL6UUD/graph.json","fetch_events":"https://pith.science/api/pith-number/PAP4DF3TQUB5GGCWRTE4XL6UUD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PAP4DF3TQUB5GGCWRTE4XL6UUD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PAP4DF3TQUB5GGCWRTE4XL6UUD/action/storage_attestation","attest_author":"https://pith.science/pith/PAP4DF3TQUB5GGCWRTE4XL6UUD/action/author_attestation","sign_citation":"https://pith.science/pith/PAP4DF3TQUB5GGCWRTE4XL6UUD/action/citation_signature","submit_replication":"https://pith.science/pith/PAP4DF3TQUB5GGCWRTE4XL6UUD/action/replication_record"}},"created_at":"2026-05-18T02:37:44.313577+00:00","updated_at":"2026-05-18T02:37:44.313577+00:00"}