{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:3ANWMPAWXQKIFH2DMZBLAJN7VT","short_pith_number":"pith:3ANWMPAW","schema_version":"1.0","canonical_sha256":"d81b663c16bc14829f436642b025bface2ebc0d61674cfa12d7619347c3de3cf","source":{"kind":"arxiv","id":"0809.3528","version":2},"attestation_state":"computed","paper":{"title":"Locating Restricted Facilities on Binary Maps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Cristina Teodora Andreica, Madalina Ecaterina Andreica, Mugurel Ionut Andreica","submitted_at":"2008-09-20T20:06:34Z","abstract_excerpt":"In this paper we consider several facility location problems with applications to cost and social welfare optimization, when the area map is encoded as a binary (0,1) mxn matrix. We present algorithmic solutions for all the problems. Some cases are too particular to be used in practical situations, but they are at least a starting point for more generic solutions."},"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":"0809.3528","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-09-20T20:06:34Z","cross_cats_sorted":[],"title_canon_sha256":"4e820ba36f9635de5d10eb39066584d5ae88fcbc71e7ecc14f868e4458dc14a6","abstract_canon_sha256":"4adaac9b203c80f76c95da7386b6e0aab85d22e21087f9063e4f3d940bd5af7a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:02.566676Z","signature_b64":"vjLCZk/K0P78YubUGGrX53HKFHWQbXqld12mGBEIMHDlw/gmD+tf4J/YSULtOjarrhnsMDqEtfPWvKT5UAwnAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d81b663c16bc14829f436642b025bface2ebc0d61674cfa12d7619347c3de3cf","last_reissued_at":"2026-05-18T03:35:02.565777Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:02.565777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Locating Restricted Facilities on Binary Maps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Cristina Teodora Andreica, Madalina Ecaterina Andreica, Mugurel Ionut Andreica","submitted_at":"2008-09-20T20:06:34Z","abstract_excerpt":"In this paper we consider several facility location problems with applications to cost and social welfare optimization, when the area map is encoded as a binary (0,1) mxn matrix. We present algorithmic solutions for all the problems. Some cases are too particular to be used in practical situations, but they are at least a starting point for more generic solutions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0809.3528","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":""},"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":"0809.3528","created_at":"2026-05-18T03:35:02.565912+00:00"},{"alias_kind":"arxiv_version","alias_value":"0809.3528v2","created_at":"2026-05-18T03:35:02.565912+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0809.3528","created_at":"2026-05-18T03:35:02.565912+00:00"},{"alias_kind":"pith_short_12","alias_value":"3ANWMPAWXQKI","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_16","alias_value":"3ANWMPAWXQKIFH2D","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_8","alias_value":"3ANWMPAW","created_at":"2026-05-18T12:25:56.245647+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/3ANWMPAWXQKIFH2DMZBLAJN7VT","json":"https://pith.science/pith/3ANWMPAWXQKIFH2DMZBLAJN7VT.json","graph_json":"https://pith.science/api/pith-number/3ANWMPAWXQKIFH2DMZBLAJN7VT/graph.json","events_json":"https://pith.science/api/pith-number/3ANWMPAWXQKIFH2DMZBLAJN7VT/events.json","paper":"https://pith.science/paper/3ANWMPAW"},"agent_actions":{"view_html":"https://pith.science/pith/3ANWMPAWXQKIFH2DMZBLAJN7VT","download_json":"https://pith.science/pith/3ANWMPAWXQKIFH2DMZBLAJN7VT.json","view_paper":"https://pith.science/paper/3ANWMPAW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0809.3528&json=true","fetch_graph":"https://pith.science/api/pith-number/3ANWMPAWXQKIFH2DMZBLAJN7VT/graph.json","fetch_events":"https://pith.science/api/pith-number/3ANWMPAWXQKIFH2DMZBLAJN7VT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3ANWMPAWXQKIFH2DMZBLAJN7VT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3ANWMPAWXQKIFH2DMZBLAJN7VT/action/storage_attestation","attest_author":"https://pith.science/pith/3ANWMPAWXQKIFH2DMZBLAJN7VT/action/author_attestation","sign_citation":"https://pith.science/pith/3ANWMPAWXQKIFH2DMZBLAJN7VT/action/citation_signature","submit_replication":"https://pith.science/pith/3ANWMPAWXQKIFH2DMZBLAJN7VT/action/replication_record"}},"created_at":"2026-05-18T03:35:02.565912+00:00","updated_at":"2026-05-18T03:35:02.565912+00:00"}