{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:K3FEV5SCFVWWZPDD64TCEWYLCJ","short_pith_number":"pith:K3FEV5SC","schema_version":"1.0","canonical_sha256":"56ca4af6422d6d6cbc63f726225b0b1254f501706b48a5ec8d042be7fb0cc737","source":{"kind":"arxiv","id":"1701.07388","version":2},"attestation_state":"computed","paper":{"title":"Extracting and Analyzing Hidden Graphs from Relational Databases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Amol Deshpande, Konstantinos Xirogiannopoulos","submitted_at":"2017-01-25T17:25:56Z","abstract_excerpt":"Analyzing interconnection structures among underlying entities or objects in a dataset through the use of graph analytics has been shown to provide tremendous value in many application domains. However, graphs are not the primary representation choice for storing most data today, and in order to have access to these analyses, users are forced to extract data from their data stores, construct the requisite graphs, and then load them into some graph engine in order to execute their graph analysis task. Moreover, these graphs can be significantly larger than the initial input stored in the databa"},"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":"1701.07388","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-01-25T17:25:56Z","cross_cats_sorted":[],"title_canon_sha256":"dd4fa6d711b4d53340bba982c063e3384c28a41c11a1901368a0ff2cb7b8e8fd","abstract_canon_sha256":"64afa7f585cdc518a12129e219aee982761b79461b5f9820026aca4c4ad3f94b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:54.222171Z","signature_b64":"iWSLrm6faNLuCpzLL1zTQeW/tEnnruNFSKPcGntRSxnRtC4i6TLH1SfzB4bBhrNPCj0g8im03NigvQTpAbsrCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"56ca4af6422d6d6cbc63f726225b0b1254f501706b48a5ec8d042be7fb0cc737","last_reissued_at":"2026-05-18T00:50:54.221496Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:54.221496Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Extracting and Analyzing Hidden Graphs from Relational Databases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Amol Deshpande, Konstantinos Xirogiannopoulos","submitted_at":"2017-01-25T17:25:56Z","abstract_excerpt":"Analyzing interconnection structures among underlying entities or objects in a dataset through the use of graph analytics has been shown to provide tremendous value in many application domains. However, graphs are not the primary representation choice for storing most data today, and in order to have access to these analyses, users are forced to extract data from their data stores, construct the requisite graphs, and then load them into some graph engine in order to execute their graph analysis task. Moreover, these graphs can be significantly larger than the initial input stored in the databa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.07388","kind":"arxiv","version":2},"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":"1701.07388","created_at":"2026-05-18T00:50:54.221575+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.07388v2","created_at":"2026-05-18T00:50:54.221575+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07388","created_at":"2026-05-18T00:50:54.221575+00:00"},{"alias_kind":"pith_short_12","alias_value":"K3FEV5SCFVWW","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"K3FEV5SCFVWWZPDD","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"K3FEV5SC","created_at":"2026-05-18T12:31:24.725408+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/K3FEV5SCFVWWZPDD64TCEWYLCJ","json":"https://pith.science/pith/K3FEV5SCFVWWZPDD64TCEWYLCJ.json","graph_json":"https://pith.science/api/pith-number/K3FEV5SCFVWWZPDD64TCEWYLCJ/graph.json","events_json":"https://pith.science/api/pith-number/K3FEV5SCFVWWZPDD64TCEWYLCJ/events.json","paper":"https://pith.science/paper/K3FEV5SC"},"agent_actions":{"view_html":"https://pith.science/pith/K3FEV5SCFVWWZPDD64TCEWYLCJ","download_json":"https://pith.science/pith/K3FEV5SCFVWWZPDD64TCEWYLCJ.json","view_paper":"https://pith.science/paper/K3FEV5SC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.07388&json=true","fetch_graph":"https://pith.science/api/pith-number/K3FEV5SCFVWWZPDD64TCEWYLCJ/graph.json","fetch_events":"https://pith.science/api/pith-number/K3FEV5SCFVWWZPDD64TCEWYLCJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K3FEV5SCFVWWZPDD64TCEWYLCJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K3FEV5SCFVWWZPDD64TCEWYLCJ/action/storage_attestation","attest_author":"https://pith.science/pith/K3FEV5SCFVWWZPDD64TCEWYLCJ/action/author_attestation","sign_citation":"https://pith.science/pith/K3FEV5SCFVWWZPDD64TCEWYLCJ/action/citation_signature","submit_replication":"https://pith.science/pith/K3FEV5SCFVWWZPDD64TCEWYLCJ/action/replication_record"}},"created_at":"2026-05-18T00:50:54.221575+00:00","updated_at":"2026-05-18T00:50:54.221575+00:00"}