{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:ZTFJUVDDSZ6VVCFQNZCIVPTPBQ","short_pith_number":"pith:ZTFJUVDD","schema_version":"1.0","canonical_sha256":"ccca9a5463967d5a88b06e448abe6f0c23992e1f356ea0e09d784af7a9324e55","source":{"kind":"arxiv","id":"1301.0725","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1301.0725","created_at":"2026-05-18T03:37:17.830062+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.0725v1","created_at":"2026-05-18T03:37:17.830062+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0725","created_at":"2026-05-18T03:37:17.830062+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZTFJUVDDSZ6V","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZTFJUVDDSZ6VVCFQ","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZTFJUVDD","created_at":"2026-05-18T12:28:09.283467+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/ZTFJUVDDSZ6VVCFQNZCIVPTPBQ","json":"https://pith.science/pith/ZTFJUVDDSZ6VVCFQNZCIVPTPBQ.json","graph_json":"https://pith.science/api/pith-number/ZTFJUVDDSZ6VVCFQNZCIVPTPBQ/graph.json","events_json":"https://pith.science/api/pith-number/ZTFJUVDDSZ6VVCFQNZCIVPTPBQ/events.json","paper":"https://pith.science/paper/ZTFJUVDD"},"agent_actions":{"view_html":"https://pith.science/pith/ZTFJUVDDSZ6VVCFQNZCIVPTPBQ","download_json":"https://pith.science/pith/ZTFJUVDDSZ6VVCFQNZCIVPTPBQ.json","view_paper":"https://pith.science/paper/ZTFJUVDD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.0725&json=true","fetch_graph":"https://pith.science/api/pith-number/ZTFJUVDDSZ6VVCFQNZCIVPTPBQ/graph.json","fetch_events":"https://pith.science/api/pith-number/ZTFJUVDDSZ6VVCFQNZCIVPTPBQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZTFJUVDDSZ6VVCFQNZCIVPTPBQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZTFJUVDDSZ6VVCFQNZCIVPTPBQ/action/storage_attestation","attest_author":"https://pith.science/pith/ZTFJUVDDSZ6VVCFQNZCIVPTPBQ/action/author_attestation","sign_citation":"https://pith.science/pith/ZTFJUVDDSZ6VVCFQNZCIVPTPBQ/action/citation_signature","submit_replication":"https://pith.science/pith/ZTFJUVDDSZ6VVCFQNZCIVPTPBQ/action/replication_record"}},"created_at":"2026-05-18T03:37:17.830062+00:00","updated_at":"2026-05-18T03:37:17.830062+00:00"}