{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ZTFJUVDDSZ6VVCFQNZCIVPTPBQ","short_pith_number":"pith:ZTFJUVDD","canonical_record":{"source":{"id":"1301.0725","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-04T13:56:25Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"62583861712d92f0281adf54bbd701913d83f9da0504ad9320bbb8e9d6506324","abstract_canon_sha256":"a6f3fb656419c79034a6f120c41a9c5c390b13e5dc29a30e930182b033ddb559"},"schema_version":"1.0"},"canonical_sha256":"ccca9a5463967d5a88b06e448abe6f0c23992e1f356ea0e09d784af7a9324e55","source":{"kind":"arxiv","id":"1301.0725","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.0725","created_at":"2026-05-18T03:37:17Z"},{"alias_kind":"arxiv_version","alias_value":"1301.0725v1","created_at":"2026-05-18T03:37:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0725","created_at":"2026-05-18T03:37:17Z"},{"alias_kind":"pith_short_12","alias_value":"ZTFJUVDDSZ6V","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZTFJUVDDSZ6VVCFQ","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZTFJUVDD","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ZTFJUVDDSZ6VVCFQNZCIVPTPBQ","target":"record","payload":{"canonical_record":{"source":{"id":"1301.0725","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-04T13:56:25Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"62583861712d92f0281adf54bbd701913d83f9da0504ad9320bbb8e9d6506324","abstract_canon_sha256":"a6f3fb656419c79034a6f120c41a9c5c390b13e5dc29a30e930182b033ddb559"},"schema_version":"1.0"},"canonical_sha256":"ccca9a5463967d5a88b06e448abe6f0c23992e1f356ea0e09d784af7a9324e55","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:37:17.830439Z","signature_b64":"qd6HvrgA39Kt9nZzbpg3/WocGHn9sa6sRQX/D4EAvHmwY7dQgEIrBEXnF7GvukEJerotHmZFqi3JLK+QbhI8Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ccca9a5463967d5a88b06e448abe6f0c23992e1f356ea0e09d784af7a9324e55","last_reissued_at":"2026-05-18T03:37:17.829995Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:37:17.829995Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.0725","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:37:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iifvt6pU6m4NayGBA5UBEgc+MWj0eCZij55ysq0v8a1Ihau6FhirA1ekgeQIV37CIENx2xOzrxuE9rpKALQSAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:09:44.203138Z"},"content_sha256":"17318778b8b1aec39f49a92429ea1e2d85a9590efa5afa8e752cd2ed8d0731fd","schema_version":"1.0","event_id":"sha256:17318778b8b1aec39f49a92429ea1e2d85a9590efa5afa8e752cd2ed8d0731fd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ZTFJUVDDSZ6VVCFQNZCIVPTPBQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Sum-over-Forests density index: identifying dense regions in a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Amin Mantrach, Fran\\c{c}ois Fouss, Marco Saerens, Masashi Shimbo, Mathieu Senelle, Silvia Garcia-Diez","submitted_at":"2013-01-04T13:56:25Z","abstract_excerpt":"This work introduces a novel nonparametric density index defined on graphs, the Sum-over-Forests (SoF) density index. It is based on a clear and intuitive idea: high-density regions in a graph are characterized by the fact that they contain a large amount of low-cost trees with high outdegrees while low-density regions contain few ones. Therefore, a Boltzmann probability distribution on the countable set of forests in the graph is defined so that large (high-cost) forests occur with a low probability while short (low-cost) forests occur with a high probability. Then, the SoF density index of a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0725","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:37:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aILwbWLFqGSA1n3d0IHvMPSoWPTy+zqh4/ScwAfWiBQ2O0ALSEkd3dLrL2wb4Aol/gSiCy+Y+jBi9ixxJ93zBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:09:44.203870Z"},"content_sha256":"30029b9c1624d1e3e29147e9e61079d402f694c6f564b66f33ae5c3f8edbd5dc","schema_version":"1.0","event_id":"sha256:30029b9c1624d1e3e29147e9e61079d402f694c6f564b66f33ae5c3f8edbd5dc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZTFJUVDDSZ6VVCFQNZCIVPTPBQ/bundle.json","state_url":"https://pith.science/pith/ZTFJUVDDSZ6VVCFQNZCIVPTPBQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZTFJUVDDSZ6VVCFQNZCIVPTPBQ/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-05-29T15:09:44Z","links":{"resolver":"https://pith.science/pith/ZTFJUVDDSZ6VVCFQNZCIVPTPBQ","bundle":"https://pith.science/pith/ZTFJUVDDSZ6VVCFQNZCIVPTPBQ/bundle.json","state":"https://pith.science/pith/ZTFJUVDDSZ6VVCFQNZCIVPTPBQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZTFJUVDDSZ6VVCFQNZCIVPTPBQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ZTFJUVDDSZ6VVCFQNZCIVPTPBQ","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":"a6f3fb656419c79034a6f120c41a9c5c390b13e5dc29a30e930182b033ddb559","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-04T13:56:25Z","title_canon_sha256":"62583861712d92f0281adf54bbd701913d83f9da0504ad9320bbb8e9d6506324"},"schema_version":"1.0","source":{"id":"1301.0725","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.0725","created_at":"2026-05-18T03:37:17Z"},{"alias_kind":"arxiv_version","alias_value":"1301.0725v1","created_at":"2026-05-18T03:37:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0725","created_at":"2026-05-18T03:37:17Z"},{"alias_kind":"pith_short_12","alias_value":"ZTFJUVDDSZ6V","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZTFJUVDDSZ6VVCFQ","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZTFJUVDD","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:30029b9c1624d1e3e29147e9e61079d402f694c6f564b66f33ae5c3f8edbd5dc","target":"graph","created_at":"2026-05-18T03:37:17Z","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":"This work introduces a novel nonparametric density index defined on graphs, the Sum-over-Forests (SoF) density index. It is based on a clear and intuitive idea: high-density regions in a graph are characterized by the fact that they contain a large amount of low-cost trees with high outdegrees while low-density regions contain few ones. Therefore, a Boltzmann probability distribution on the countable set of forests in the graph is defined so that large (high-cost) forests occur with a low probability while short (low-cost) forests occur with a high probability. Then, the SoF density index of a","authors_text":"Amin Mantrach, Fran\\c{c}ois Fouss, Marco Saerens, Masashi Shimbo, Mathieu Senelle, Silvia Garcia-Diez","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-04T13:56:25Z","title":"The Sum-over-Forests density index: identifying dense regions in a graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0725","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:17318778b8b1aec39f49a92429ea1e2d85a9590efa5afa8e752cd2ed8d0731fd","target":"record","created_at":"2026-05-18T03:37:17Z","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":"a6f3fb656419c79034a6f120c41a9c5c390b13e5dc29a30e930182b033ddb559","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-04T13:56:25Z","title_canon_sha256":"62583861712d92f0281adf54bbd701913d83f9da0504ad9320bbb8e9d6506324"},"schema_version":"1.0","source":{"id":"1301.0725","kind":"arxiv","version":1}},"canonical_sha256":"ccca9a5463967d5a88b06e448abe6f0c23992e1f356ea0e09d784af7a9324e55","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ccca9a5463967d5a88b06e448abe6f0c23992e1f356ea0e09d784af7a9324e55","first_computed_at":"2026-05-18T03:37:17.829995Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:37:17.829995Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qd6HvrgA39Kt9nZzbpg3/WocGHn9sa6sRQX/D4EAvHmwY7dQgEIrBEXnF7GvukEJerotHmZFqi3JLK+QbhI8Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:37:17.830439Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.0725","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:17318778b8b1aec39f49a92429ea1e2d85a9590efa5afa8e752cd2ed8d0731fd","sha256:30029b9c1624d1e3e29147e9e61079d402f694c6f564b66f33ae5c3f8edbd5dc"],"state_sha256":"006dd272224827e3459cd406324a7791838543377dc4d38c3b1934e929e59c1e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J18D+8GRKQDzile0IEZ/LKxtnRIw8QxG6B3rcUtlnFDxqY328DlWpkYKeL3HdWbA1nrSRmSjZ8QnsV2gb1gQDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T15:09:44.207986Z","bundle_sha256":"55250167d8f006ed98cc6d3f1cccd3acf7f0b068bd3113c00bb880b659d1dc95"}}