{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:2PSN5JFSFHE4OCTBEQIFBMVDYY","short_pith_number":"pith:2PSN5JFS","schema_version":"1.0","canonical_sha256":"d3e4dea4b229c9c70a61241050b2a3c602d9c6beaa2e2c1f7e524b3c509e2f40","source":{"kind":"arxiv","id":"1703.01594","version":1},"attestation_state":"computed","paper":{"title":"Graph sampling with determinantal processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Nicolas Tremblay, Pierre-Olivier Amblard, Simon Barthelm\\'e","submitted_at":"2017-03-05T13:18:19Z","abstract_excerpt":"We present a new random sampling strategy for k-bandlimited signals defined on graphs, based on determinantal point processes (DPP). For small graphs, ie, in cases where the spectrum of the graph is accessible, we exhibit a DPP sampling scheme that enables perfect recovery of bandlimited signals. For large graphs, ie, in cases where the graph's spectrum is not accessible, we investigate, both theoretically and empirically, a sub-optimal but much faster DPP based on loop-erased random walks on the graph. Preliminary experiments show promising results especially in cases where the number of meas"},"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":"1703.01594","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-05T13:18:19Z","cross_cats_sorted":["cs.SI","stat.ML"],"title_canon_sha256":"66d57ae3e2b1eeb315f9346c16a64d347009e6d7b16fc3645ca8eb9741491e70","abstract_canon_sha256":"771933d979d41600cac527a5ba027aaaf1a13daf930ed07df7baa696ca65d27d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:30.197312Z","signature_b64":"KmEZAqxSZ23Dza55dk1Lf2GAfBRbi5SRCALkoFcVH28Xjr/rpC7cWtk2mWHAubm25D+hQQui3MFSGKUitKyHBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3e4dea4b229c9c70a61241050b2a3c602d9c6beaa2e2c1f7e524b3c509e2f40","last_reissued_at":"2026-05-18T00:49:30.196717Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:30.196717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph sampling with determinantal processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Nicolas Tremblay, Pierre-Olivier Amblard, Simon Barthelm\\'e","submitted_at":"2017-03-05T13:18:19Z","abstract_excerpt":"We present a new random sampling strategy for k-bandlimited signals defined on graphs, based on determinantal point processes (DPP). For small graphs, ie, in cases where the spectrum of the graph is accessible, we exhibit a DPP sampling scheme that enables perfect recovery of bandlimited signals. For large graphs, ie, in cases where the graph's spectrum is not accessible, we investigate, both theoretically and empirically, a sub-optimal but much faster DPP based on loop-erased random walks on the graph. Preliminary experiments show promising results especially in cases where the number of meas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.01594","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":"1703.01594","created_at":"2026-05-18T00:49:30.196820+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.01594v1","created_at":"2026-05-18T00:49:30.196820+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.01594","created_at":"2026-05-18T00:49:30.196820+00:00"},{"alias_kind":"pith_short_12","alias_value":"2PSN5JFSFHE4","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"2PSN5JFSFHE4OCTB","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"2PSN5JFS","created_at":"2026-05-18T12:30:55.937587+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.13127","citing_title":"State-of-art minibatches via novel DPP kernels: discretization, wavelets, and rough objectives","ref_index":126,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2PSN5JFSFHE4OCTBEQIFBMVDYY","json":"https://pith.science/pith/2PSN5JFSFHE4OCTBEQIFBMVDYY.json","graph_json":"https://pith.science/api/pith-number/2PSN5JFSFHE4OCTBEQIFBMVDYY/graph.json","events_json":"https://pith.science/api/pith-number/2PSN5JFSFHE4OCTBEQIFBMVDYY/events.json","paper":"https://pith.science/paper/2PSN5JFS"},"agent_actions":{"view_html":"https://pith.science/pith/2PSN5JFSFHE4OCTBEQIFBMVDYY","download_json":"https://pith.science/pith/2PSN5JFSFHE4OCTBEQIFBMVDYY.json","view_paper":"https://pith.science/paper/2PSN5JFS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.01594&json=true","fetch_graph":"https://pith.science/api/pith-number/2PSN5JFSFHE4OCTBEQIFBMVDYY/graph.json","fetch_events":"https://pith.science/api/pith-number/2PSN5JFSFHE4OCTBEQIFBMVDYY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2PSN5JFSFHE4OCTBEQIFBMVDYY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2PSN5JFSFHE4OCTBEQIFBMVDYY/action/storage_attestation","attest_author":"https://pith.science/pith/2PSN5JFSFHE4OCTBEQIFBMVDYY/action/author_attestation","sign_citation":"https://pith.science/pith/2PSN5JFSFHE4OCTBEQIFBMVDYY/action/citation_signature","submit_replication":"https://pith.science/pith/2PSN5JFSFHE4OCTBEQIFBMVDYY/action/replication_record"}},"created_at":"2026-05-18T00:49:30.196820+00:00","updated_at":"2026-05-18T00:49:30.196820+00:00"}