{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:D2XN25IKFMBQBJZKDVLRQN7QX2","short_pith_number":"pith:D2XN25IK","schema_version":"1.0","canonical_sha256":"1eaedd750a2b0300a72a1d571837f0beb81f1f92662129c263d9f1f159b1a26b","source":{"kind":"arxiv","id":"2607.08102","version":1},"attestation_state":"computed","paper":{"title":"Decomposition-Based QAOA for Maximum Coverage Location Problem in Satellite Constellation Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"quant-ph","authors_text":"Amiratabak Bahengam, Divya Sisodiya, Hang Woon Lee, Hao Chen","submitted_at":"2026-07-09T04:39:44Z","abstract_excerpt":"An increase in earth observation missions has increased the demand of efficient design and optimization of satellite constellations. Maximizing coverage of the target while effectively utilizing the limited orbital resources is one of the critical design challenges for complex combinatorial optimization problems. The maximal covering location problem (MCLP), serves as a base for orbital coverage modeling, is NP-hard and computationally intractable for large-constellation instances. Using heuristics, metaheuristics, and mixed-integer linear programming, classical solvers have achieved optimal o"},"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":"2607.08102","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-07-09T04:39:44Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"ae33e1702efe76b07e4ad8c50891b293c2707cd5743843124a8d725510323489","abstract_canon_sha256":"fb24c2a5b81fb2db6551614b7458992b3de8466b64a5eb93378772e431fe88d7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-10T01:19:26.072374Z","signature_b64":"JtiOxR8a2urXDP2+6NrnAHFC70x2bdgp/+DKzy12fSUOVLqBhZUYt8CktwGvVysUjkabceSaISxmmGSVuQDaAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1eaedd750a2b0300a72a1d571837f0beb81f1f92662129c263d9f1f159b1a26b","last_reissued_at":"2026-07-10T01:19:26.071859Z","signature_status":"signed_v1","first_computed_at":"2026-07-10T01:19:26.071859Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decomposition-Based QAOA for Maximum Coverage Location Problem in Satellite Constellation Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"quant-ph","authors_text":"Amiratabak Bahengam, Divya Sisodiya, Hang Woon Lee, Hao Chen","submitted_at":"2026-07-09T04:39:44Z","abstract_excerpt":"An increase in earth observation missions has increased the demand of efficient design and optimization of satellite constellations. Maximizing coverage of the target while effectively utilizing the limited orbital resources is one of the critical design challenges for complex combinatorial optimization problems. The maximal covering location problem (MCLP), serves as a base for orbital coverage modeling, is NP-hard and computationally intractable for large-constellation instances. Using heuristics, metaheuristics, and mixed-integer linear programming, classical solvers have achieved optimal o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.08102","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/2607.08102/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":"2607.08102","created_at":"2026-07-10T01:19:26.071919+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.08102v1","created_at":"2026-07-10T01:19:26.071919+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.08102","created_at":"2026-07-10T01:19:26.071919+00:00"},{"alias_kind":"pith_short_12","alias_value":"D2XN25IKFMBQ","created_at":"2026-07-10T01:19:26.071919+00:00"},{"alias_kind":"pith_short_16","alias_value":"D2XN25IKFMBQBJZK","created_at":"2026-07-10T01:19:26.071919+00:00"},{"alias_kind":"pith_short_8","alias_value":"D2XN25IK","created_at":"2026-07-10T01:19:26.071919+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/D2XN25IKFMBQBJZKDVLRQN7QX2","json":"https://pith.science/pith/D2XN25IKFMBQBJZKDVLRQN7QX2.json","graph_json":"https://pith.science/api/pith-number/D2XN25IKFMBQBJZKDVLRQN7QX2/graph.json","events_json":"https://pith.science/api/pith-number/D2XN25IKFMBQBJZKDVLRQN7QX2/events.json","paper":"https://pith.science/paper/D2XN25IK"},"agent_actions":{"view_html":"https://pith.science/pith/D2XN25IKFMBQBJZKDVLRQN7QX2","download_json":"https://pith.science/pith/D2XN25IKFMBQBJZKDVLRQN7QX2.json","view_paper":"https://pith.science/paper/D2XN25IK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.08102&json=true","fetch_graph":"https://pith.science/api/pith-number/D2XN25IKFMBQBJZKDVLRQN7QX2/graph.json","fetch_events":"https://pith.science/api/pith-number/D2XN25IKFMBQBJZKDVLRQN7QX2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D2XN25IKFMBQBJZKDVLRQN7QX2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D2XN25IKFMBQBJZKDVLRQN7QX2/action/storage_attestation","attest_author":"https://pith.science/pith/D2XN25IKFMBQBJZKDVLRQN7QX2/action/author_attestation","sign_citation":"https://pith.science/pith/D2XN25IKFMBQBJZKDVLRQN7QX2/action/citation_signature","submit_replication":"https://pith.science/pith/D2XN25IKFMBQBJZKDVLRQN7QX2/action/replication_record"}},"created_at":"2026-07-10T01:19:26.071919+00:00","updated_at":"2026-07-10T01:19:26.071919+00:00"}