{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:LXHMOMHEBSI2Q5PME4LVLK4KUQ","short_pith_number":"pith:LXHMOMHE","schema_version":"1.0","canonical_sha256":"5dcec730e40c91a875ec271755ab8aa42c64add412dfa5afd88adcaafc515c32","source":{"kind":"arxiv","id":"1307.7411","version":3},"attestation_state":"computed","paper":{"title":"Towards an Efficient Discovery of the Topological Representative Subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Engelbert Mephu Nguifo, Mohamed Moussaoui, Rabie Saidi, Wajdi Dhifli","submitted_at":"2013-07-28T22:17:40Z","abstract_excerpt":"With the emergence of graph databases, the task of frequent subgraph discovery has been extensively addressed. Although the proposed approaches in the literature have made this task feasible, the number of discovered frequent subgraphs is still very high to be efficiently used in any further exploration. Feature selection for graph data is a way to reduce the high number of frequent subgraphs based on exact or approximate structural similarity. However, current structural similarity strategies are not efficient enough in many real-world applications, besides, the combinatorial nature of graphs"},"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":"1307.7411","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-07-28T22:17:40Z","cross_cats_sorted":[],"title_canon_sha256":"b74e25f6b9a12df95d8043552fb8efce61066ab62e5fa6c16672b02dd897c75c","abstract_canon_sha256":"1d2ac659dc14edd60e790ad2d75db9bdc1cc6fce4099b5432124038b4d969cb7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:55.441239Z","signature_b64":"8AjHt29ekj3s3YQylov9Ex5JQUMj/7E7i0wlR+DSk6I7NXrjwSgcKzOMMFlyaDYlRUynY6yQT1NenbltEew7CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5dcec730e40c91a875ec271755ab8aa42c64add412dfa5afd88adcaafc515c32","last_reissued_at":"2026-05-18T03:15:55.440352Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:55.440352Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards an Efficient Discovery of the Topological Representative Subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Engelbert Mephu Nguifo, Mohamed Moussaoui, Rabie Saidi, Wajdi Dhifli","submitted_at":"2013-07-28T22:17:40Z","abstract_excerpt":"With the emergence of graph databases, the task of frequent subgraph discovery has been extensively addressed. Although the proposed approaches in the literature have made this task feasible, the number of discovered frequent subgraphs is still very high to be efficiently used in any further exploration. Feature selection for graph data is a way to reduce the high number of frequent subgraphs based on exact or approximate structural similarity. However, current structural similarity strategies are not efficient enough in many real-world applications, besides, the combinatorial nature of graphs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.7411","kind":"arxiv","version":3},"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":"1307.7411","created_at":"2026-05-18T03:15:55.440509+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.7411v3","created_at":"2026-05-18T03:15:55.440509+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.7411","created_at":"2026-05-18T03:15:55.440509+00:00"},{"alias_kind":"pith_short_12","alias_value":"LXHMOMHEBSI2","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"LXHMOMHEBSI2Q5PM","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"LXHMOMHE","created_at":"2026-05-18T12:27:51.066281+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/LXHMOMHEBSI2Q5PME4LVLK4KUQ","json":"https://pith.science/pith/LXHMOMHEBSI2Q5PME4LVLK4KUQ.json","graph_json":"https://pith.science/api/pith-number/LXHMOMHEBSI2Q5PME4LVLK4KUQ/graph.json","events_json":"https://pith.science/api/pith-number/LXHMOMHEBSI2Q5PME4LVLK4KUQ/events.json","paper":"https://pith.science/paper/LXHMOMHE"},"agent_actions":{"view_html":"https://pith.science/pith/LXHMOMHEBSI2Q5PME4LVLK4KUQ","download_json":"https://pith.science/pith/LXHMOMHEBSI2Q5PME4LVLK4KUQ.json","view_paper":"https://pith.science/paper/LXHMOMHE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.7411&json=true","fetch_graph":"https://pith.science/api/pith-number/LXHMOMHEBSI2Q5PME4LVLK4KUQ/graph.json","fetch_events":"https://pith.science/api/pith-number/LXHMOMHEBSI2Q5PME4LVLK4KUQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LXHMOMHEBSI2Q5PME4LVLK4KUQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LXHMOMHEBSI2Q5PME4LVLK4KUQ/action/storage_attestation","attest_author":"https://pith.science/pith/LXHMOMHEBSI2Q5PME4LVLK4KUQ/action/author_attestation","sign_citation":"https://pith.science/pith/LXHMOMHEBSI2Q5PME4LVLK4KUQ/action/citation_signature","submit_replication":"https://pith.science/pith/LXHMOMHEBSI2Q5PME4LVLK4KUQ/action/replication_record"}},"created_at":"2026-05-18T03:15:55.440509+00:00","updated_at":"2026-05-18T03:15:55.440509+00:00"}