{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:Z66ZGMBXNPTO3CB5LVV62ALUPO","short_pith_number":"pith:Z66ZGMBX","schema_version":"1.0","canonical_sha256":"cfbd9330376be6ed883d5d6bed01747bac1cee9be454d5591ae628809b0f3f10","source":{"kind":"arxiv","id":"2411.02612","version":3},"attestation_state":"computed","paper":{"title":"Eulerian orientations and Hadamard codes: A novel connection via counting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Shuai Shao, Zhuxiao Tang","submitted_at":"2024-11-04T21:05:54Z","abstract_excerpt":"We discover a novel connection between two classical mathematical notions, Eulerian orientations and Hadamard codes by studying the counting problem of Eulerian orientations (\\#EO) with local constraint functions imposed on vertices. We present two special classes of constraint functions and a chain reaction algorithm, and show that the \\#EO problem defined by each class alone is polynomial-time solvable by the algorithm. These tractable classes of functions are defined inductively, and quite remarkably the base level of these classes is characterized perfectly by the well-known Hadamard code."},"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":"2411.02612","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-11-04T21:05:54Z","cross_cats_sorted":[],"title_canon_sha256":"1f37ac81c4252f9de83f2ed1fec48514f57f32a00eb0136d52491949a4edbb9a","abstract_canon_sha256":"ad7d20916c36549c0065449fe792b53697b038f363b4c37a05b9ae87f45e06d7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-13T01:17:38.794048Z","signature_b64":"E5op9XvelSod+icNZyPG3YjePNTwpebx5T1lgETQmozPGJt3pi2dG6wN41GSPxaX0jWIlfNVfdpXBe4vDRJJAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cfbd9330376be6ed883d5d6bed01747bac1cee9be454d5591ae628809b0f3f10","last_reissued_at":"2026-07-13T01:17:38.792756Z","signature_status":"signed_v1","first_computed_at":"2026-07-13T01:17:38.792756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Eulerian orientations and Hadamard codes: A novel connection via counting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Shuai Shao, Zhuxiao Tang","submitted_at":"2024-11-04T21:05:54Z","abstract_excerpt":"We discover a novel connection between two classical mathematical notions, Eulerian orientations and Hadamard codes by studying the counting problem of Eulerian orientations (\\#EO) with local constraint functions imposed on vertices. We present two special classes of constraint functions and a chain reaction algorithm, and show that the \\#EO problem defined by each class alone is polynomial-time solvable by the algorithm. These tractable classes of functions are defined inductively, and quite remarkably the base level of these classes is characterized perfectly by the well-known Hadamard code."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.02612","kind":"arxiv","version":3},"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/2411.02612/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":"2411.02612","created_at":"2026-07-13T01:17:38.793372+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.02612v3","created_at":"2026-07-13T01:17:38.793372+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.02612","created_at":"2026-07-13T01:17:38.793372+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z66ZGMBXNPTO","created_at":"2026-07-13T01:17:38.793372+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z66ZGMBXNPTO3CB5","created_at":"2026-07-13T01:17:38.793372+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z66ZGMBX","created_at":"2026-07-13T01:17:38.793372+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.05597","citing_title":"From an odd arity signature to a Holant dichotomy","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Z66ZGMBXNPTO3CB5LVV62ALUPO","json":"https://pith.science/pith/Z66ZGMBXNPTO3CB5LVV62ALUPO.json","graph_json":"https://pith.science/api/pith-number/Z66ZGMBXNPTO3CB5LVV62ALUPO/graph.json","events_json":"https://pith.science/api/pith-number/Z66ZGMBXNPTO3CB5LVV62ALUPO/events.json","paper":"https://pith.science/paper/Z66ZGMBX"},"agent_actions":{"view_html":"https://pith.science/pith/Z66ZGMBXNPTO3CB5LVV62ALUPO","download_json":"https://pith.science/pith/Z66ZGMBXNPTO3CB5LVV62ALUPO.json","view_paper":"https://pith.science/paper/Z66ZGMBX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.02612&json=true","fetch_graph":"https://pith.science/api/pith-number/Z66ZGMBXNPTO3CB5LVV62ALUPO/graph.json","fetch_events":"https://pith.science/api/pith-number/Z66ZGMBXNPTO3CB5LVV62ALUPO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z66ZGMBXNPTO3CB5LVV62ALUPO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z66ZGMBXNPTO3CB5LVV62ALUPO/action/storage_attestation","attest_author":"https://pith.science/pith/Z66ZGMBXNPTO3CB5LVV62ALUPO/action/author_attestation","sign_citation":"https://pith.science/pith/Z66ZGMBXNPTO3CB5LVV62ALUPO/action/citation_signature","submit_replication":"https://pith.science/pith/Z66ZGMBXNPTO3CB5LVV62ALUPO/action/replication_record"}},"created_at":"2026-07-13T01:17:38.793372+00:00","updated_at":"2026-07-13T01:17:38.793372+00:00"}