{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:D4MLARASPRPM6LF3GRPUVJROTJ","short_pith_number":"pith:D4MLARAS","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"},"canonical_sha256":"1f18b044127c5ecf2cbb345f4aa62e9a6d0337a881a18d40c1a6d8da2594e1fe","source":{"kind":"arxiv","id":"1812.10346","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.10346","created_at":"2026-07-05T01:06:46Z"},{"alias_kind":"arxiv_version","alias_value":"1812.10346v2","created_at":"2026-07-05T01:06:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.10346","created_at":"2026-07-05T01:06:46Z"},{"alias_kind":"pith_short_12","alias_value":"D4MLARASPRPM","created_at":"2026-07-05T01:06:46Z"},{"alias_kind":"pith_short_16","alias_value":"D4MLARASPRPM6LF3","created_at":"2026-07-05T01:06:46Z"},{"alias_kind":"pith_short_8","alias_value":"D4MLARAS","created_at":"2026-07-05T01:06:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:D4MLARASPRPM6LF3GRPUVJROTJ","target":"record","payload":{"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"},"canonical_sha256":"1f18b044127c5ecf2cbb345f4aa62e9a6d0337a881a18d40c1a6d8da2594e1fe","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"},"source_kind":"arxiv","source_id":"1812.10346","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T01:06:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LALjaM+YWLPS/KBADQ71pWr1PiibodhUJ/lUDjDhrM/MkRVpzOOzZ1Xkki1sv9Rl+TprVnF7APuSuHM4bQtsCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T16:20:56.871311Z"},"content_sha256":"3d98d1b88353eb821e75dda2440e6ef57993171c69490c7b78e391bcc46dff61","schema_version":"1.0","event_id":"sha256:3d98d1b88353eb821e75dda2440e6ef57993171c69490c7b78e391bcc46dff61"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:D4MLARASPRPM6LF3GRPUVJROTJ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T01:06:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bMroNXu/dfLa+EIBU0BIsThkEofrCTksfTYZdoMCpykwt0Y1XSfnxKaQqfIBt8gNs6K1OH2FMvkCYXa/NSFuDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T16:20:56.871821Z"},"content_sha256":"6230ea3eecab97e1152166931009555435131acd21ea422e104a9b0b2d193ad6","schema_version":"1.0","event_id":"sha256:6230ea3eecab97e1152166931009555435131acd21ea422e104a9b0b2d193ad6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D4MLARASPRPM6LF3GRPUVJROTJ/bundle.json","state_url":"https://pith.science/pith/D4MLARASPRPM6LF3GRPUVJROTJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D4MLARASPRPM6LF3GRPUVJROTJ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-07T16:20:56Z","links":{"resolver":"https://pith.science/pith/D4MLARASPRPM6LF3GRPUVJROTJ","bundle":"https://pith.science/pith/D4MLARASPRPM6LF3GRPUVJROTJ/bundle.json","state":"https://pith.science/pith/D4MLARASPRPM6LF3GRPUVJROTJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D4MLARASPRPM6LF3GRPUVJROTJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:D4MLARASPRPM6LF3GRPUVJROTJ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1eb2b78eda3a96587bfb59b64f933b6be10a5f5eabe9d727d80bf54c4b7c0810","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-26T15:45:05Z","title_canon_sha256":"24b2706115488c2b71ae39bf761e4546ae7e3e56c377a43595e061dd25b6fa9d"},"schema_version":"1.0","source":{"id":"1812.10346","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.10346","created_at":"2026-07-05T01:06:46Z"},{"alias_kind":"arxiv_version","alias_value":"1812.10346v2","created_at":"2026-07-05T01:06:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.10346","created_at":"2026-07-05T01:06:46Z"},{"alias_kind":"pith_short_12","alias_value":"D4MLARASPRPM","created_at":"2026-07-05T01:06:46Z"},{"alias_kind":"pith_short_16","alias_value":"D4MLARASPRPM6LF3","created_at":"2026-07-05T01:06:46Z"},{"alias_kind":"pith_short_8","alias_value":"D4MLARAS","created_at":"2026-07-05T01:06:46Z"}],"graph_snapshots":[{"event_id":"sha256:6230ea3eecab97e1152166931009555435131acd21ea422e104a9b0b2d193ad6","target":"graph","created_at":"2026-07-05T01:06:46Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1812.10346/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Adam M. Lowrance, Ben McCarty, Scott Baldridge","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-26T15:45:05Z","title":"The 2-Factor Polynomial Detects Even Perfect Matchings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.10346","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3d98d1b88353eb821e75dda2440e6ef57993171c69490c7b78e391bcc46dff61","target":"record","created_at":"2026-07-05T01:06:46Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1eb2b78eda3a96587bfb59b64f933b6be10a5f5eabe9d727d80bf54c4b7c0810","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-26T15:45:05Z","title_canon_sha256":"24b2706115488c2b71ae39bf761e4546ae7e3e56c377a43595e061dd25b6fa9d"},"schema_version":"1.0","source":{"id":"1812.10346","kind":"arxiv","version":2}},"canonical_sha256":"1f18b044127c5ecf2cbb345f4aa62e9a6d0337a881a18d40c1a6d8da2594e1fe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1f18b044127c5ecf2cbb345f4aa62e9a6d0337a881a18d40c1a6d8da2594e1fe","first_computed_at":"2026-07-05T01:06:46.841361Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:06:46.841361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0xah+mQJMU7k6nLMw5M6gxo4jmXsS7VL3jwMCGadxVTCIpJtkCgp5GOLVoGpNIWmF7hkcaFbvC7PGnw0aNK1CQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:06:46.841841Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.10346","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d98d1b88353eb821e75dda2440e6ef57993171c69490c7b78e391bcc46dff61","sha256:6230ea3eecab97e1152166931009555435131acd21ea422e104a9b0b2d193ad6"],"state_sha256":"423a74b96ad5e156e4292f4e6a668fc6d4575aaa20694310d86b6808d3d29e5e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EcrTU4GtBLbnH+WCY4iyDFpzVQ3s82o1QJ7WMCfHLAa+tCQ3Qt06qWe2ukbVm9e386TV9aui/TcGmRq//7tvCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T16:20:56.877352Z","bundle_sha256":"1e77ccf55e7338dc1b330063b70cae986916c2ddd948d9d4c7e8a3cdb61bd8cb"}}