{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:KRMA6TFA4REBTRY3KZN54KDD73","short_pith_number":"pith:KRMA6TFA","schema_version":"1.0","canonical_sha256":"54580f4ca0e44819c71b565bde2863fec08950f368303c351011f208277f0367","source":{"kind":"arxiv","id":"1609.08266","version":1},"attestation_state":"computed","paper":{"title":"Mining Statistically Significant Attribute Associations in Attributed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.SI","authors_text":"Jihwan Lee, Keehwan Park, Sunil Prabhakar","submitted_at":"2016-09-27T05:53:45Z","abstract_excerpt":"Recently, graphs have been widely used to represent many different kinds of real world data or observations such as social networks, protein-protein networks, road networks, and so on. In many cases, each node in a graph is associated with a set of its attributes and it is critical to not only consider the link structure of a graph but also use the attribute information to achieve more meaningful results in various graph mining tasks. Most previous works with attributed graphs take into ac- count attribute relationships only between individually connected nodes. However, it should be greatly v"},"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":"1609.08266","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-09-27T05:53:45Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"1d780bf63c6b851ce5720cee301ac7c704701936681a9ae6627d04c33f211094","abstract_canon_sha256":"b72ba8c641f17eb3c7b454f1c45a21a0252f47edd58171e35f9a36dd17ac28c0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:46.276383Z","signature_b64":"5IIMqCIjO3tN1zj9QS5ZoaIFDSza0ZfQbnOS3nFjzUO0QP1CIeE+DTVzmj4b+GAVLCV19vK7g/8gkqED/iTiDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54580f4ca0e44819c71b565bde2863fec08950f368303c351011f208277f0367","last_reissued_at":"2026-05-18T01:03:46.275961Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:46.275961Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mining Statistically Significant Attribute Associations in Attributed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.SI","authors_text":"Jihwan Lee, Keehwan Park, Sunil Prabhakar","submitted_at":"2016-09-27T05:53:45Z","abstract_excerpt":"Recently, graphs have been widely used to represent many different kinds of real world data or observations such as social networks, protein-protein networks, road networks, and so on. In many cases, each node in a graph is associated with a set of its attributes and it is critical to not only consider the link structure of a graph but also use the attribute information to achieve more meaningful results in various graph mining tasks. Most previous works with attributed graphs take into ac- count attribute relationships only between individually connected nodes. However, it should be greatly v"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.08266","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":"1609.08266","created_at":"2026-05-18T01:03:46.276022+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.08266v1","created_at":"2026-05-18T01:03:46.276022+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.08266","created_at":"2026-05-18T01:03:46.276022+00:00"},{"alias_kind":"pith_short_12","alias_value":"KRMA6TFA4REB","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"KRMA6TFA4REBTRY3","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"KRMA6TFA","created_at":"2026-05-18T12:30:29.479603+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/KRMA6TFA4REBTRY3KZN54KDD73","json":"https://pith.science/pith/KRMA6TFA4REBTRY3KZN54KDD73.json","graph_json":"https://pith.science/api/pith-number/KRMA6TFA4REBTRY3KZN54KDD73/graph.json","events_json":"https://pith.science/api/pith-number/KRMA6TFA4REBTRY3KZN54KDD73/events.json","paper":"https://pith.science/paper/KRMA6TFA"},"agent_actions":{"view_html":"https://pith.science/pith/KRMA6TFA4REBTRY3KZN54KDD73","download_json":"https://pith.science/pith/KRMA6TFA4REBTRY3KZN54KDD73.json","view_paper":"https://pith.science/paper/KRMA6TFA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.08266&json=true","fetch_graph":"https://pith.science/api/pith-number/KRMA6TFA4REBTRY3KZN54KDD73/graph.json","fetch_events":"https://pith.science/api/pith-number/KRMA6TFA4REBTRY3KZN54KDD73/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KRMA6TFA4REBTRY3KZN54KDD73/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KRMA6TFA4REBTRY3KZN54KDD73/action/storage_attestation","attest_author":"https://pith.science/pith/KRMA6TFA4REBTRY3KZN54KDD73/action/author_attestation","sign_citation":"https://pith.science/pith/KRMA6TFA4REBTRY3KZN54KDD73/action/citation_signature","submit_replication":"https://pith.science/pith/KRMA6TFA4REBTRY3KZN54KDD73/action/replication_record"}},"created_at":"2026-05-18T01:03:46.276022+00:00","updated_at":"2026-05-18T01:03:46.276022+00:00"}