{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:DQA7S65KW75I576G4YYA4POQH3","short_pith_number":"pith:DQA7S65K","canonical_record":{"source":{"id":"1305.2025","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"astro-ph.IM","submitted_at":"2013-05-09T08:04:08Z","cross_cats_sorted":["astro-ph.HE"],"title_canon_sha256":"48f83dec14aad80cef4a3130677b221d7b61d9f6c903a48dc7d46d442f6b48c9","abstract_canon_sha256":"1aeaf8a9d2233ad56b23030d5d44f009ef25461e0abd930fc4638a2d2bc3376f"},"schema_version":"1.0"},"canonical_sha256":"1c01f97baab7fa8effc6e6300e3dd03eea9e73f4e3339f18877d474da5ac792b","source":{"kind":"arxiv","id":"1305.2025","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.2025","created_at":"2026-05-18T03:16:49Z"},{"alias_kind":"arxiv_version","alias_value":"1305.2025v1","created_at":"2026-05-18T03:16:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.2025","created_at":"2026-05-18T03:16:49Z"},{"alias_kind":"pith_short_12","alias_value":"DQA7S65KW75I","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DQA7S65KW75I576G","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DQA7S65K","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:DQA7S65KW75I576G4YYA4POQH3","target":"record","payload":{"canonical_record":{"source":{"id":"1305.2025","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"astro-ph.IM","submitted_at":"2013-05-09T08:04:08Z","cross_cats_sorted":["astro-ph.HE"],"title_canon_sha256":"48f83dec14aad80cef4a3130677b221d7b61d9f6c903a48dc7d46d442f6b48c9","abstract_canon_sha256":"1aeaf8a9d2233ad56b23030d5d44f009ef25461e0abd930fc4638a2d2bc3376f"},"schema_version":"1.0"},"canonical_sha256":"1c01f97baab7fa8effc6e6300e3dd03eea9e73f4e3339f18877d474da5ac792b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:16:49.125117Z","signature_b64":"aZgjJTDrCcQKmcbfcEOQswQ/bXu9fqhudgoTtV54Aw8k/aJF+Gf8G1vYRuFRLT7/EV6UwU82CpK2XxQyY8dwCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c01f97baab7fa8effc6e6300e3dd03eea9e73f4e3339f18877d474da5ac792b","last_reissued_at":"2026-05-18T03:16:49.124452Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:16:49.124452Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.2025","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:16:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gO5971d0j4iJDjd3ag+oys3STHL6jxRnPASYOqHvqH9Uuzx+y5hwXew67mlzfVhVN+3TNfJ1sfn6pT6t8QoqBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:58:43.181657Z"},"content_sha256":"7d723d08febb5e8824f53d333b4733f70be8f0edc6da0c48804738a748908ad6","schema_version":"1.0","event_id":"sha256:7d723d08febb5e8824f53d333b4733f70be8f0edc6da0c48804738a748908ad6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:DQA7S65KW75I576G4YYA4POQH3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimal spanning tree algorithm for gamma-ray source detection in sparse photon images: cluster parameters and selection strategies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["astro-ph.HE"],"primary_cat":"astro-ph.IM","authors_text":"E. Bernieri, E. Massaro, F. Tinebra, G. Tosti, R. Campana","submitted_at":"2013-05-09T08:04:08Z","abstract_excerpt":"The minimal spanning tree (MST) algorithm is a graph-theoretical cluster-finding method. We previously applied it to gamma-ray bidimensional images, showing that it is quite sensitive in finding faint sources. Possible sources are associated with the regions where the photon arrival directions clusterize. MST selects clusters starting from a particular \"tree\" connecting all the point of the image and performing a cut based on the angular distance between photons, with a number of events higher than a given threshold. In this paper, we show how a further filtering, based on some parameters link"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.2025","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:16:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rCSFbGELvZRwtP5Jd6V6dnrtSsxEYeZv/jD/e26B/UbK2D4hdPJS2FLiiygeX2Pklpnq1eprxJUzK5a5da01BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:58:43.182092Z"},"content_sha256":"f7a25f564499a6d03fe60d704235faaff5110bd420a42c16498a2fb2ebe5d3ec","schema_version":"1.0","event_id":"sha256:f7a25f564499a6d03fe60d704235faaff5110bd420a42c16498a2fb2ebe5d3ec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DQA7S65KW75I576G4YYA4POQH3/bundle.json","state_url":"https://pith.science/pith/DQA7S65KW75I576G4YYA4POQH3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DQA7S65KW75I576G4YYA4POQH3/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T21:58:43Z","links":{"resolver":"https://pith.science/pith/DQA7S65KW75I576G4YYA4POQH3","bundle":"https://pith.science/pith/DQA7S65KW75I576G4YYA4POQH3/bundle.json","state":"https://pith.science/pith/DQA7S65KW75I576G4YYA4POQH3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DQA7S65KW75I576G4YYA4POQH3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:DQA7S65KW75I576G4YYA4POQH3","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1aeaf8a9d2233ad56b23030d5d44f009ef25461e0abd930fc4638a2d2bc3376f","cross_cats_sorted":["astro-ph.HE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"astro-ph.IM","submitted_at":"2013-05-09T08:04:08Z","title_canon_sha256":"48f83dec14aad80cef4a3130677b221d7b61d9f6c903a48dc7d46d442f6b48c9"},"schema_version":"1.0","source":{"id":"1305.2025","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.2025","created_at":"2026-05-18T03:16:49Z"},{"alias_kind":"arxiv_version","alias_value":"1305.2025v1","created_at":"2026-05-18T03:16:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.2025","created_at":"2026-05-18T03:16:49Z"},{"alias_kind":"pith_short_12","alias_value":"DQA7S65KW75I","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DQA7S65KW75I576G","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DQA7S65K","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:f7a25f564499a6d03fe60d704235faaff5110bd420a42c16498a2fb2ebe5d3ec","target":"graph","created_at":"2026-05-18T03:16:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"The minimal spanning tree (MST) algorithm is a graph-theoretical cluster-finding method. We previously applied it to gamma-ray bidimensional images, showing that it is quite sensitive in finding faint sources. Possible sources are associated with the regions where the photon arrival directions clusterize. MST selects clusters starting from a particular \"tree\" connecting all the point of the image and performing a cut based on the angular distance between photons, with a number of events higher than a given threshold. In this paper, we show how a further filtering, based on some parameters link","authors_text":"E. Bernieri, E. Massaro, F. Tinebra, G. Tosti, R. Campana","cross_cats":["astro-ph.HE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"astro-ph.IM","submitted_at":"2013-05-09T08:04:08Z","title":"Minimal spanning tree algorithm for gamma-ray source detection in sparse photon images: cluster parameters and selection strategies"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.2025","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7d723d08febb5e8824f53d333b4733f70be8f0edc6da0c48804738a748908ad6","target":"record","created_at":"2026-05-18T03:16:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1aeaf8a9d2233ad56b23030d5d44f009ef25461e0abd930fc4638a2d2bc3376f","cross_cats_sorted":["astro-ph.HE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"astro-ph.IM","submitted_at":"2013-05-09T08:04:08Z","title_canon_sha256":"48f83dec14aad80cef4a3130677b221d7b61d9f6c903a48dc7d46d442f6b48c9"},"schema_version":"1.0","source":{"id":"1305.2025","kind":"arxiv","version":1}},"canonical_sha256":"1c01f97baab7fa8effc6e6300e3dd03eea9e73f4e3339f18877d474da5ac792b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1c01f97baab7fa8effc6e6300e3dd03eea9e73f4e3339f18877d474da5ac792b","first_computed_at":"2026-05-18T03:16:49.124452Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:16:49.124452Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aZgjJTDrCcQKmcbfcEOQswQ/bXu9fqhudgoTtV54Aw8k/aJF+Gf8G1vYRuFRLT7/EV6UwU82CpK2XxQyY8dwCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:16:49.125117Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.2025","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7d723d08febb5e8824f53d333b4733f70be8f0edc6da0c48804738a748908ad6","sha256:f7a25f564499a6d03fe60d704235faaff5110bd420a42c16498a2fb2ebe5d3ec"],"state_sha256":"d0e8b3866ef2e6e56418fdc813d16bfeefc06b8532e8b45263bf208c3dac4df7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k/KoSasJsb+lV8e95dbRqKwm84VDQenK8dW4vJK8PWkO6SfGmg1E6UX6WQyw5bhMo3Qu9s+/PEqQp9RofzJ1AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T21:58:43.184111Z","bundle_sha256":"d96d0166c93d414754efa4d07fe84525b6d7314456713e6d347042ad4ec496ec"}}