{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:TWUVTN3IK4WXB6JXHGLFSZQ6VT","short_pith_number":"pith:TWUVTN3I","schema_version":"1.0","canonical_sha256":"9da959b768572d70f937399659661eacd1432bfe52ae1acf24a173aae7562ef8","source":{"kind":"arxiv","id":"2606.26653","version":1},"attestation_state":"computed","paper":{"title":"Testing Equivalence to the Hamiltonian Cycle Polynomial","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Agrim Dewan (Indian Insitute of Science, Bengaluru)","submitted_at":"2026-06-25T06:31:46Z","abstract_excerpt":"The Hamiltonian Cycle polynomial, denoted as $HC_n$, is defined to be the sum of the weighted Hamiltonian Cycles in an $n$-vertex complete digraph, with vertices labeled $1$ to $n$ and edges weighted by formal variables $x_{i,j}$. Valiant (STOC 1979) studied the Permanent and $HC$, defined as the family $\\{HC_n | \\ n \\geq 1\\}$, and showed both families are VNP-complete, the former over any field of characteristic other than $2$, and the latter over any field. Since its introduction, $HC$ has been studied from the perspective of lower bounds by Jerrum-Snir (JACM 1982), determinantal complexity "},"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":"2606.26653","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-06-25T06:31:46Z","cross_cats_sorted":[],"title_canon_sha256":"2026be8710ec6914cc7779928768336f0353993ac78cdc410010a6ec74a1f0b7","abstract_canon_sha256":"f955e064095a5f2aa53a4d97419859ccb24dee1c7d28276a610efc38d00b0656"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-26T01:15:55.804098Z","signature_b64":"3g1PoS0Y96wT/KWEt7VW1wiuy5cX3ja9Wzj1RZcIFvWCGfMDaio1ytopkmYF0f55MFJrtQltCFg0eg4qn2+KBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9da959b768572d70f937399659661eacd1432bfe52ae1acf24a173aae7562ef8","last_reissued_at":"2026-06-26T01:15:55.803620Z","signature_status":"signed_v1","first_computed_at":"2026-06-26T01:15:55.803620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Testing Equivalence to the Hamiltonian Cycle Polynomial","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Agrim Dewan (Indian Insitute of Science, Bengaluru)","submitted_at":"2026-06-25T06:31:46Z","abstract_excerpt":"The Hamiltonian Cycle polynomial, denoted as $HC_n$, is defined to be the sum of the weighted Hamiltonian Cycles in an $n$-vertex complete digraph, with vertices labeled $1$ to $n$ and edges weighted by formal variables $x_{i,j}$. Valiant (STOC 1979) studied the Permanent and $HC$, defined as the family $\\{HC_n | \\ n \\geq 1\\}$, and showed both families are VNP-complete, the former over any field of characteristic other than $2$, and the latter over any field. Since its introduction, $HC$ has been studied from the perspective of lower bounds by Jerrum-Snir (JACM 1982), determinantal complexity "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.26653","kind":"arxiv","version":1},"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/2606.26653/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":"2606.26653","created_at":"2026-06-26T01:15:55.803677+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.26653v1","created_at":"2026-06-26T01:15:55.803677+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.26653","created_at":"2026-06-26T01:15:55.803677+00:00"},{"alias_kind":"pith_short_12","alias_value":"TWUVTN3IK4WX","created_at":"2026-06-26T01:15:55.803677+00:00"},{"alias_kind":"pith_short_16","alias_value":"TWUVTN3IK4WXB6JX","created_at":"2026-06-26T01:15:55.803677+00:00"},{"alias_kind":"pith_short_8","alias_value":"TWUVTN3I","created_at":"2026-06-26T01:15:55.803677+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/TWUVTN3IK4WXB6JXHGLFSZQ6VT","json":"https://pith.science/pith/TWUVTN3IK4WXB6JXHGLFSZQ6VT.json","graph_json":"https://pith.science/api/pith-number/TWUVTN3IK4WXB6JXHGLFSZQ6VT/graph.json","events_json":"https://pith.science/api/pith-number/TWUVTN3IK4WXB6JXHGLFSZQ6VT/events.json","paper":"https://pith.science/paper/TWUVTN3I"},"agent_actions":{"view_html":"https://pith.science/pith/TWUVTN3IK4WXB6JXHGLFSZQ6VT","download_json":"https://pith.science/pith/TWUVTN3IK4WXB6JXHGLFSZQ6VT.json","view_paper":"https://pith.science/paper/TWUVTN3I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.26653&json=true","fetch_graph":"https://pith.science/api/pith-number/TWUVTN3IK4WXB6JXHGLFSZQ6VT/graph.json","fetch_events":"https://pith.science/api/pith-number/TWUVTN3IK4WXB6JXHGLFSZQ6VT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TWUVTN3IK4WXB6JXHGLFSZQ6VT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TWUVTN3IK4WXB6JXHGLFSZQ6VT/action/storage_attestation","attest_author":"https://pith.science/pith/TWUVTN3IK4WXB6JXHGLFSZQ6VT/action/author_attestation","sign_citation":"https://pith.science/pith/TWUVTN3IK4WXB6JXHGLFSZQ6VT/action/citation_signature","submit_replication":"https://pith.science/pith/TWUVTN3IK4WXB6JXHGLFSZQ6VT/action/replication_record"}},"created_at":"2026-06-26T01:15:55.803677+00:00","updated_at":"2026-06-26T01:15:55.803677+00:00"}