{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:UVU3O3PRIC3DR46DC2WASW5KUI","short_pith_number":"pith:UVU3O3PR","schema_version":"1.0","canonical_sha256":"a569b76df140b638f3c316ac095baaa2383ec15bba748b1b06319d4a574c6317","source":{"kind":"arxiv","id":"2507.20441","version":1},"attestation_state":"computed","paper":{"title":"TIMEST: Temporal Information Motif Estimator Using Sampling Trees","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DS","cs.IR"],"primary_cat":"cs.DB","authors_text":"C. Seshadhri, Nishil Talati, Omkar Bhalerao, Yunjie Pan","submitted_at":"2025-07-27T23:31:55Z","abstract_excerpt":"The mining of pattern subgraphs, known as motifs, is a core task in the field of graph mining. Edges in real-world networks often have timestamps, so there is a need for temporal motif mining. A temporal motif is a richer structure that imposes timing constraints on the edges of the motif. Temporal motifs have been used to analyze social networks, financial transactions, and biological networks.\n  Motif counting in temporal graphs is particularly challenging. A graph with millions of edges can have trillions of temporal motifs, since the same edge can occur with multiple timestamps. There is 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":"2507.20441","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2025-07-27T23:31:55Z","cross_cats_sorted":["cs.DS","cs.IR"],"title_canon_sha256":"72f3fb92d60038cb04bce23e4105b4b49e45c280999e74a2a5eb58fbff236508","abstract_canon_sha256":"9d7650b7a00054eb5866411d46a2b39a740aa00006733c7542bfbb05b5cc9793"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:44:19.459723Z","signature_b64":"1WB5eGhHY1BOcwdWb8n+Iz3llJaCcFn0MtM7nPywVH8rzWpyOroTfGbHjF7uih3kXH8cHVye7ng36JfQMEWSBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a569b76df140b638f3c316ac095baaa2383ec15bba748b1b06319d4a574c6317","last_reissued_at":"2026-07-05T11:44:19.459149Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:44:19.459149Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"TIMEST: Temporal Information Motif Estimator Using Sampling Trees","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DS","cs.IR"],"primary_cat":"cs.DB","authors_text":"C. Seshadhri, Nishil Talati, Omkar Bhalerao, Yunjie Pan","submitted_at":"2025-07-27T23:31:55Z","abstract_excerpt":"The mining of pattern subgraphs, known as motifs, is a core task in the field of graph mining. Edges in real-world networks often have timestamps, so there is a need for temporal motif mining. A temporal motif is a richer structure that imposes timing constraints on the edges of the motif. Temporal motifs have been used to analyze social networks, financial transactions, and biological networks.\n  Motif counting in temporal graphs is particularly challenging. A graph with millions of edges can have trillions of temporal motifs, since the same edge can occur with multiple timestamps. There is a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.20441","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.20441/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2507.20441","created_at":"2026-07-05T11:44:19.459202+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.20441v1","created_at":"2026-07-05T11:44:19.459202+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.20441","created_at":"2026-07-05T11:44:19.459202+00:00"},{"alias_kind":"pith_short_12","alias_value":"UVU3O3PRIC3D","created_at":"2026-07-05T11:44:19.459202+00:00"},{"alias_kind":"pith_short_16","alias_value":"UVU3O3PRIC3DR46D","created_at":"2026-07-05T11:44:19.459202+00:00"},{"alias_kind":"pith_short_8","alias_value":"UVU3O3PR","created_at":"2026-07-05T11:44:19.459202+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/UVU3O3PRIC3DR46DC2WASW5KUI","json":"https://pith.science/pith/UVU3O3PRIC3DR46DC2WASW5KUI.json","graph_json":"https://pith.science/api/pith-number/UVU3O3PRIC3DR46DC2WASW5KUI/graph.json","events_json":"https://pith.science/api/pith-number/UVU3O3PRIC3DR46DC2WASW5KUI/events.json","paper":"https://pith.science/paper/UVU3O3PR"},"agent_actions":{"view_html":"https://pith.science/pith/UVU3O3PRIC3DR46DC2WASW5KUI","download_json":"https://pith.science/pith/UVU3O3PRIC3DR46DC2WASW5KUI.json","view_paper":"https://pith.science/paper/UVU3O3PR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.20441&json=true","fetch_graph":"https://pith.science/api/pith-number/UVU3O3PRIC3DR46DC2WASW5KUI/graph.json","fetch_events":"https://pith.science/api/pith-number/UVU3O3PRIC3DR46DC2WASW5KUI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UVU3O3PRIC3DR46DC2WASW5KUI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UVU3O3PRIC3DR46DC2WASW5KUI/action/storage_attestation","attest_author":"https://pith.science/pith/UVU3O3PRIC3DR46DC2WASW5KUI/action/author_attestation","sign_citation":"https://pith.science/pith/UVU3O3PRIC3DR46DC2WASW5KUI/action/citation_signature","submit_replication":"https://pith.science/pith/UVU3O3PRIC3DR46DC2WASW5KUI/action/replication_record"}},"created_at":"2026-07-05T11:44:19.459202+00:00","updated_at":"2026-07-05T11:44:19.459202+00:00"}