{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:46DVTYOFQZ7EFM2LC2NDMIR6TS","short_pith_number":"pith:46DVTYOF","schema_version":"1.0","canonical_sha256":"e78759e1c5867e42b34b169a36223e9c8ad563c5b8287a6603d6d9696c5cd17e","source":{"kind":"arxiv","id":"1210.7156","version":4},"attestation_state":"computed","paper":{"title":"Learning-Based Constraint Satisfaction With Sensing Restrictions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Alessandro Checco, Douglas Leith","submitted_at":"2012-10-26T14:33:39Z","abstract_excerpt":"In this paper we consider graph-coloring problems, an important subset of general constraint satisfaction problems that arise in wireless resource allocation. We constructively establish the existence of fully decentralized learning-based algorithms that are able to find a proper coloring even in the presence of strong sensing restrictions, in particular sensing asymmetry of the type encountered when hidden terminals are present. Our main analytic contribution is to establish sufficient conditions on the sensing behaviour to ensure that the solvers find satisfying assignments with probability "},"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":"1210.7156","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-10-26T14:33:39Z","cross_cats_sorted":[],"title_canon_sha256":"59c17e381765221d30a24f82ff2e0ec5dd1fb32401c5d4e66455b0479b0e23ca","abstract_canon_sha256":"7cee9a6ae0712f9b995ea9f3973ac021d367261a12235fd183a40f6b5710004e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:53:37.215075Z","signature_b64":"/Vwh6rmt+lmXg1uxE50IKNBPB/WghPQvN7PHOl1+zzcNnYJpRj1eBdrIDreHJTDkG3oWK+Fh2H+T/QzJizRbDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e78759e1c5867e42b34b169a36223e9c8ad563c5b8287a6603d6d9696c5cd17e","last_reissued_at":"2026-05-18T01:53:37.214465Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:53:37.214465Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning-Based Constraint Satisfaction With Sensing Restrictions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Alessandro Checco, Douglas Leith","submitted_at":"2012-10-26T14:33:39Z","abstract_excerpt":"In this paper we consider graph-coloring problems, an important subset of general constraint satisfaction problems that arise in wireless resource allocation. We constructively establish the existence of fully decentralized learning-based algorithms that are able to find a proper coloring even in the presence of strong sensing restrictions, in particular sensing asymmetry of the type encountered when hidden terminals are present. Our main analytic contribution is to establish sufficient conditions on the sensing behaviour to ensure that the solvers find satisfying assignments with probability "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.7156","kind":"arxiv","version":4},"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":"1210.7156","created_at":"2026-05-18T01:53:37.214557+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.7156v4","created_at":"2026-05-18T01:53:37.214557+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.7156","created_at":"2026-05-18T01:53:37.214557+00:00"},{"alias_kind":"pith_short_12","alias_value":"46DVTYOFQZ7E","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"46DVTYOFQZ7EFM2L","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"46DVTYOF","created_at":"2026-05-18T12:26:53.410803+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/46DVTYOFQZ7EFM2LC2NDMIR6TS","json":"https://pith.science/pith/46DVTYOFQZ7EFM2LC2NDMIR6TS.json","graph_json":"https://pith.science/api/pith-number/46DVTYOFQZ7EFM2LC2NDMIR6TS/graph.json","events_json":"https://pith.science/api/pith-number/46DVTYOFQZ7EFM2LC2NDMIR6TS/events.json","paper":"https://pith.science/paper/46DVTYOF"},"agent_actions":{"view_html":"https://pith.science/pith/46DVTYOFQZ7EFM2LC2NDMIR6TS","download_json":"https://pith.science/pith/46DVTYOFQZ7EFM2LC2NDMIR6TS.json","view_paper":"https://pith.science/paper/46DVTYOF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.7156&json=true","fetch_graph":"https://pith.science/api/pith-number/46DVTYOFQZ7EFM2LC2NDMIR6TS/graph.json","fetch_events":"https://pith.science/api/pith-number/46DVTYOFQZ7EFM2LC2NDMIR6TS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/46DVTYOFQZ7EFM2LC2NDMIR6TS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/46DVTYOFQZ7EFM2LC2NDMIR6TS/action/storage_attestation","attest_author":"https://pith.science/pith/46DVTYOFQZ7EFM2LC2NDMIR6TS/action/author_attestation","sign_citation":"https://pith.science/pith/46DVTYOFQZ7EFM2LC2NDMIR6TS/action/citation_signature","submit_replication":"https://pith.science/pith/46DVTYOFQZ7EFM2LC2NDMIR6TS/action/replication_record"}},"created_at":"2026-05-18T01:53:37.214557+00:00","updated_at":"2026-05-18T01:53:37.214557+00:00"}