{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:NLCT2LOZFATKWLFF73VLP57FKO","short_pith_number":"pith:NLCT2LOZ","schema_version":"1.0","canonical_sha256":"6ac53d2dd92826ab2ca5feeab7f7e553b98cac7b024967ecbd8c20043bda6234","source":{"kind":"arxiv","id":"1609.00909","version":1},"attestation_state":"computed","paper":{"title":"The growth constant of odd cutsets in high dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Ohad Noy Feldheim, Yinon Spinka","submitted_at":"2016-09-04T09:19:58Z","abstract_excerpt":"A cutset is a non-empty finite subset of $\\mathbb{Z}^d$ which is both connected and co-connected. A cutset is odd if its vertex boundary lies in the odd bipartition class of $\\mathbb{Z}^d$. Peled suggested that the number of odd cutsets which contain the origin and have $n$ boundary edges may be of order $e^{\\Theta(n/d)}$ as $d \\to \\infty$, much smaller than the number of general cutsets, which was shown by Lebowitz and Mazel to be of order $d^{\\Theta(n/d)}$. In this paper, we verify this by showing that the number of such odd cutsets is $(2+o(1))^{n/2d}$."},"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":"1609.00909","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-04T09:19:58Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"2207dda646a94c3a6c1830cd8f79f29e011eebfd38b6c4940a7fe7ba24db4980","abstract_canon_sha256":"84e2a8316e3757b54bcf477e0c63a745f8826644cf2d5dfa85ac1b86baadf66c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:06:19.591679Z","signature_b64":"GyY1zNEor85Sch3FJqNkYsP121NfZ3y/wnxZfmNMD2w19X1dRDMcS4Ed1rUMidOL6BiEAheccXpJ60zflmv5Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ac53d2dd92826ab2ca5feeab7f7e553b98cac7b024967ecbd8c20043bda6234","last_reissued_at":"2026-05-18T01:06:19.590987Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:06:19.590987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The growth constant of odd cutsets in high dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Ohad Noy Feldheim, Yinon Spinka","submitted_at":"2016-09-04T09:19:58Z","abstract_excerpt":"A cutset is a non-empty finite subset of $\\mathbb{Z}^d$ which is both connected and co-connected. A cutset is odd if its vertex boundary lies in the odd bipartition class of $\\mathbb{Z}^d$. Peled suggested that the number of odd cutsets which contain the origin and have $n$ boundary edges may be of order $e^{\\Theta(n/d)}$ as $d \\to \\infty$, much smaller than the number of general cutsets, which was shown by Lebowitz and Mazel to be of order $d^{\\Theta(n/d)}$. In this paper, we verify this by showing that the number of such odd cutsets is $(2+o(1))^{n/2d}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.00909","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":""},"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":"1609.00909","created_at":"2026-05-18T01:06:19.591094+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.00909v1","created_at":"2026-05-18T01:06:19.591094+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.00909","created_at":"2026-05-18T01:06:19.591094+00:00"},{"alias_kind":"pith_short_12","alias_value":"NLCT2LOZFATK","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"NLCT2LOZFATKWLFF","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"NLCT2LOZ","created_at":"2026-05-18T12:30:32.724797+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/NLCT2LOZFATKWLFF73VLP57FKO","json":"https://pith.science/pith/NLCT2LOZFATKWLFF73VLP57FKO.json","graph_json":"https://pith.science/api/pith-number/NLCT2LOZFATKWLFF73VLP57FKO/graph.json","events_json":"https://pith.science/api/pith-number/NLCT2LOZFATKWLFF73VLP57FKO/events.json","paper":"https://pith.science/paper/NLCT2LOZ"},"agent_actions":{"view_html":"https://pith.science/pith/NLCT2LOZFATKWLFF73VLP57FKO","download_json":"https://pith.science/pith/NLCT2LOZFATKWLFF73VLP57FKO.json","view_paper":"https://pith.science/paper/NLCT2LOZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.00909&json=true","fetch_graph":"https://pith.science/api/pith-number/NLCT2LOZFATKWLFF73VLP57FKO/graph.json","fetch_events":"https://pith.science/api/pith-number/NLCT2LOZFATKWLFF73VLP57FKO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NLCT2LOZFATKWLFF73VLP57FKO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NLCT2LOZFATKWLFF73VLP57FKO/action/storage_attestation","attest_author":"https://pith.science/pith/NLCT2LOZFATKWLFF73VLP57FKO/action/author_attestation","sign_citation":"https://pith.science/pith/NLCT2LOZFATKWLFF73VLP57FKO/action/citation_signature","submit_replication":"https://pith.science/pith/NLCT2LOZFATKWLFF73VLP57FKO/action/replication_record"}},"created_at":"2026-05-18T01:06:19.591094+00:00","updated_at":"2026-05-18T01:06:19.591094+00:00"}