{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:D4MLARASPRPM6LF3GRPUVJROTJ","short_pith_number":"pith:D4MLARAS","schema_version":"1.0","canonical_sha256":"1f18b044127c5ecf2cbb345f4aa62e9a6d0337a881a18d40c1a6d8da2594e1fe","source":{"kind":"arxiv","id":"1812.10346","version":2},"attestation_state":"computed","paper":{"title":"The 2-Factor Polynomial Detects Even Perfect Matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adam M. Lowrance, Ben McCarty, Scott Baldridge","submitted_at":"2018-12-26T15:45:05Z","abstract_excerpt":"In this paper, we prove that the 2-factor polynomial, an invariant of a planar trivalent graph with a perfect matching, counts the number of 2- factors that contain the the perfect matching as a subgraph. Consequently, we show that the polynomial detects even perfect matchings."},"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":"1812.10346","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-26T15:45:05Z","cross_cats_sorted":[],"title_canon_sha256":"24b2706115488c2b71ae39bf761e4546ae7e3e56c377a43595e061dd25b6fa9d","abstract_canon_sha256":"1eb2b78eda3a96587bfb59b64f933b6be10a5f5eabe9d727d80bf54c4b7c0810"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:06:46.841841Z","signature_b64":"0xah+mQJMU7k6nLMw5M6gxo4jmXsS7VL3jwMCGadxVTCIpJtkCgp5GOLVoGpNIWmF7hkcaFbvC7PGnw0aNK1CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f18b044127c5ecf2cbb345f4aa62e9a6d0337a881a18d40c1a6d8da2594e1fe","last_reissued_at":"2026-07-05T01:06:46.841361Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:06:46.841361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The 2-Factor Polynomial Detects Even Perfect Matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adam M. Lowrance, Ben McCarty, Scott Baldridge","submitted_at":"2018-12-26T15:45:05Z","abstract_excerpt":"In this paper, we prove that the 2-factor polynomial, an invariant of a planar trivalent graph with a perfect matching, counts the number of 2- factors that contain the the perfect matching as a subgraph. Consequently, we show that the polynomial detects even perfect matchings."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.10346","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1812.10346/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1812.10346","created_at":"2026-07-05T01:06:46.841414+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.10346v2","created_at":"2026-07-05T01:06:46.841414+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.10346","created_at":"2026-07-05T01:06:46.841414+00:00"},{"alias_kind":"pith_short_12","alias_value":"D4MLARASPRPM","created_at":"2026-07-05T01:06:46.841414+00:00"},{"alias_kind":"pith_short_16","alias_value":"D4MLARASPRPM6LF3","created_at":"2026-07-05T01:06:46.841414+00:00"},{"alias_kind":"pith_short_8","alias_value":"D4MLARAS","created_at":"2026-07-05T01:06:46.841414+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/D4MLARASPRPM6LF3GRPUVJROTJ","json":"https://pith.science/pith/D4MLARASPRPM6LF3GRPUVJROTJ.json","graph_json":"https://pith.science/api/pith-number/D4MLARASPRPM6LF3GRPUVJROTJ/graph.json","events_json":"https://pith.science/api/pith-number/D4MLARASPRPM6LF3GRPUVJROTJ/events.json","paper":"https://pith.science/paper/D4MLARAS"},"agent_actions":{"view_html":"https://pith.science/pith/D4MLARASPRPM6LF3GRPUVJROTJ","download_json":"https://pith.science/pith/D4MLARASPRPM6LF3GRPUVJROTJ.json","view_paper":"https://pith.science/paper/D4MLARAS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.10346&json=true","fetch_graph":"https://pith.science/api/pith-number/D4MLARASPRPM6LF3GRPUVJROTJ/graph.json","fetch_events":"https://pith.science/api/pith-number/D4MLARASPRPM6LF3GRPUVJROTJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D4MLARASPRPM6LF3GRPUVJROTJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D4MLARASPRPM6LF3GRPUVJROTJ/action/storage_attestation","attest_author":"https://pith.science/pith/D4MLARASPRPM6LF3GRPUVJROTJ/action/author_attestation","sign_citation":"https://pith.science/pith/D4MLARASPRPM6LF3GRPUVJROTJ/action/citation_signature","submit_replication":"https://pith.science/pith/D4MLARASPRPM6LF3GRPUVJROTJ/action/replication_record"}},"created_at":"2026-07-05T01:06:46.841414+00:00","updated_at":"2026-07-05T01:06:46.841414+00:00"}