{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:N6Z3FLYUPD77G4LTUB4K5P3RVV","short_pith_number":"pith:N6Z3FLYU","canonical_record":{"source":{"id":"2410.11557","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-10-15T12:47:07Z","cross_cats_sorted":[],"title_canon_sha256":"c361d7ddf1ac9d4f2ba0ebe65c2cff75d3e15ffbd7cac8fc44d445b712d91275","abstract_canon_sha256":"ca030247736771dbeff1d2ce2c52a4fb7737b201f75bea78cf42d078d97c4d9e"},"schema_version":"1.0"},"canonical_sha256":"6fb3b2af1478fff37173a078aebf71ad6d39a08a3fd9de29d09787c03af6d949","source":{"kind":"arxiv","id":"2410.11557","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.11557","created_at":"2026-07-05T10:53:48Z"},{"alias_kind":"arxiv_version","alias_value":"2410.11557v2","created_at":"2026-07-05T10:53:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.11557","created_at":"2026-07-05T10:53:48Z"},{"alias_kind":"pith_short_12","alias_value":"N6Z3FLYUPD77","created_at":"2026-07-05T10:53:48Z"},{"alias_kind":"pith_short_16","alias_value":"N6Z3FLYUPD77G4LT","created_at":"2026-07-05T10:53:48Z"},{"alias_kind":"pith_short_8","alias_value":"N6Z3FLYU","created_at":"2026-07-05T10:53:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:N6Z3FLYUPD77G4LTUB4K5P3RVV","target":"record","payload":{"canonical_record":{"source":{"id":"2410.11557","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-10-15T12:47:07Z","cross_cats_sorted":[],"title_canon_sha256":"c361d7ddf1ac9d4f2ba0ebe65c2cff75d3e15ffbd7cac8fc44d445b712d91275","abstract_canon_sha256":"ca030247736771dbeff1d2ce2c52a4fb7737b201f75bea78cf42d078d97c4d9e"},"schema_version":"1.0"},"canonical_sha256":"6fb3b2af1478fff37173a078aebf71ad6d39a08a3fd9de29d09787c03af6d949","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:53:48.325273Z","signature_b64":"Hn/fiPUqp4R8aq3LwhSqBBWJ6713kALwn7k2UaLa/f0kBIevoy2yyJ0sRaFW+jiUhe4V356zSh6GlvyrEaEQAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6fb3b2af1478fff37173a078aebf71ad6d39a08a3fd9de29d09787c03af6d949","last_reissued_at":"2026-07-05T10:53:48.324742Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:53:48.324742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2410.11557","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-05T10:53:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q5MiHgWHFSxgXBy5KbyvimlYprr1Wi6S01S9ShEBTE70C6VvV5yzSHAqFJyNptIAw2DDQVVJSOxAPwo9AwvmCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T14:24:40.203384Z"},"content_sha256":"f78d3d85b747aa5566197adc039189d7ed4ffc3117b448a235cec1b47c89acc5","schema_version":"1.0","event_id":"sha256:f78d3d85b747aa5566197adc039189d7ed4ffc3117b448a235cec1b47c89acc5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:N6Z3FLYUPD77G4LTUB4K5P3RVV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"P-time Algorithms for Typical #EO Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Boning Meng, Juqiu Wang, Mingji Xia","submitted_at":"2024-10-15T12:47:07Z","abstract_excerpt":"In this article, we study the computational complexity of counting weighted Eulerian orientations, denoted as \\#\\textsf{EO}. This problem is considered a pivotal scenario in the complexity classification for \\textsf{Holant}, a counting framework of great significance. Our results consist of three parts. First, we prove a complexity dichotomy theorem for \\#\\textsf{EO} defined by a set of binary and quaternary signatures, which generalizes the previous dichotomy for the six-vertex model. Second, we prove a dichotomy for \\#\\textsf{EO} defined by a set of so-called pure signatures, which possess t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.11557","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/2410.11557/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-05T10:53:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B4ym2Lfh61TJDrZzbiSiGgEoQB68DtolXbn+n9yvVEj2EZheO99stDMuv1EnzurKztm/adr1fCH/TviNOSv6Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T14:24:40.203875Z"},"content_sha256":"22b5fb18d1195f5225f01614052de9c632175c0d8cb4b09c2e2ae7fb154b313b","schema_version":"1.0","event_id":"sha256:22b5fb18d1195f5225f01614052de9c632175c0d8cb4b09c2e2ae7fb154b313b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N6Z3FLYUPD77G4LTUB4K5P3RVV/bundle.json","state_url":"https://pith.science/pith/N6Z3FLYUPD77G4LTUB4K5P3RVV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N6Z3FLYUPD77G4LTUB4K5P3RVV/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-10T14:24:40Z","links":{"resolver":"https://pith.science/pith/N6Z3FLYUPD77G4LTUB4K5P3RVV","bundle":"https://pith.science/pith/N6Z3FLYUPD77G4LTUB4K5P3RVV/bundle.json","state":"https://pith.science/pith/N6Z3FLYUPD77G4LTUB4K5P3RVV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N6Z3FLYUPD77G4LTUB4K5P3RVV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:N6Z3FLYUPD77G4LTUB4K5P3RVV","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":"ca030247736771dbeff1d2ce2c52a4fb7737b201f75bea78cf42d078d97c4d9e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-10-15T12:47:07Z","title_canon_sha256":"c361d7ddf1ac9d4f2ba0ebe65c2cff75d3e15ffbd7cac8fc44d445b712d91275"},"schema_version":"1.0","source":{"id":"2410.11557","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.11557","created_at":"2026-07-05T10:53:48Z"},{"alias_kind":"arxiv_version","alias_value":"2410.11557v2","created_at":"2026-07-05T10:53:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.11557","created_at":"2026-07-05T10:53:48Z"},{"alias_kind":"pith_short_12","alias_value":"N6Z3FLYUPD77","created_at":"2026-07-05T10:53:48Z"},{"alias_kind":"pith_short_16","alias_value":"N6Z3FLYUPD77G4LT","created_at":"2026-07-05T10:53:48Z"},{"alias_kind":"pith_short_8","alias_value":"N6Z3FLYU","created_at":"2026-07-05T10:53:48Z"}],"graph_snapshots":[{"event_id":"sha256:22b5fb18d1195f5225f01614052de9c632175c0d8cb4b09c2e2ae7fb154b313b","target":"graph","created_at":"2026-07-05T10:53:48Z","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/2410.11557/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this article, we study the computational complexity of counting weighted Eulerian orientations, denoted as \\#\\textsf{EO}. This problem is considered a pivotal scenario in the complexity classification for \\textsf{Holant}, a counting framework of great significance. Our results consist of three parts. First, we prove a complexity dichotomy theorem for \\#\\textsf{EO} defined by a set of binary and quaternary signatures, which generalizes the previous dichotomy for the six-vertex model. Second, we prove a dichotomy for \\#\\textsf{EO} defined by a set of so-called pure signatures, which possess t","authors_text":"Boning Meng, Juqiu Wang, Mingji Xia","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-10-15T12:47:07Z","title":"P-time Algorithms for Typical #EO Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.11557","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:f78d3d85b747aa5566197adc039189d7ed4ffc3117b448a235cec1b47c89acc5","target":"record","created_at":"2026-07-05T10:53:48Z","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":"ca030247736771dbeff1d2ce2c52a4fb7737b201f75bea78cf42d078d97c4d9e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-10-15T12:47:07Z","title_canon_sha256":"c361d7ddf1ac9d4f2ba0ebe65c2cff75d3e15ffbd7cac8fc44d445b712d91275"},"schema_version":"1.0","source":{"id":"2410.11557","kind":"arxiv","version":2}},"canonical_sha256":"6fb3b2af1478fff37173a078aebf71ad6d39a08a3fd9de29d09787c03af6d949","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6fb3b2af1478fff37173a078aebf71ad6d39a08a3fd9de29d09787c03af6d949","first_computed_at":"2026-07-05T10:53:48.324742Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:53:48.324742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Hn/fiPUqp4R8aq3LwhSqBBWJ6713kALwn7k2UaLa/f0kBIevoy2yyJ0sRaFW+jiUhe4V356zSh6GlvyrEaEQAw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:53:48.325273Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.11557","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f78d3d85b747aa5566197adc039189d7ed4ffc3117b448a235cec1b47c89acc5","sha256:22b5fb18d1195f5225f01614052de9c632175c0d8cb4b09c2e2ae7fb154b313b"],"state_sha256":"13a9d98803c09b06aaa0dcd63be925d705a5049591f00f39af96bd34d005db83"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"opGvyYHvHzoB7K3p3ewyq3vbZzNnRpCvvjx9XBIA0NAxRodLH6aBn//e4EuZvJW2u7uyu6LFsKOFcWfTXG8RCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T14:24:40.207743Z","bundle_sha256":"f07cf654d61897e95148ea55da345bbc2472aa084ef2a3c1ce8e971ecb600c2b"}}