{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VEWTW2XJCGLWPWSZNRVF4VWV56","short_pith_number":"pith:VEWTW2XJ","schema_version":"1.0","canonical_sha256":"a92d3b6ae9119767da596c6a5e56d5ef95c48b0770f4229bf944e52a107c2eb9","source":{"kind":"arxiv","id":"1810.08408","version":1},"attestation_state":"computed","paper":{"title":"Flow Motifs in Interaction Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Chrysanthi Kosyfaki, Evaggelia Pitoura, Nikos Mamoulis, Panayiotis Tsaparas","submitted_at":"2018-10-19T09:05:22Z","abstract_excerpt":"Many real-world phenomena are best represented as interaction networks with dynamic structures (e.g., transaction networks, social networks, traffic networks). Interaction networks capture flow of data which is transferred between their vertices along a timeline. Analyzing such networks is crucial toward comprehend- ing processes in them. A typical analysis task is the finding of motifs, which are small subgraph patterns that repeat themselves in the network. In this paper, we introduce network flow motifs, a novel type of motifs that model significant flow transfer among a set of vertices wit"},"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":"1810.08408","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2018-10-19T09:05:22Z","cross_cats_sorted":[],"title_canon_sha256":"c0e2c6eb0a520bfbc5b0176fa6f24b68c607c6a726b3829727542fd905ba1a61","abstract_canon_sha256":"7845c840acaacb9d7fc8b3513fca7dac06758bdb41850439403184fe2d0507a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:48.180030Z","signature_b64":"u7iVIPHxEOuZv2eT0ffhNBj42TRCERK5oA8HIg0Ep2XTRl+DrDY/F3uOZLewtDE8qg8mHPb5x5KuUi/3Bd7pCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a92d3b6ae9119767da596c6a5e56d5ef95c48b0770f4229bf944e52a107c2eb9","last_reissued_at":"2026-05-18T00:02:48.179388Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:48.179388Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Flow Motifs in Interaction Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Chrysanthi Kosyfaki, Evaggelia Pitoura, Nikos Mamoulis, Panayiotis Tsaparas","submitted_at":"2018-10-19T09:05:22Z","abstract_excerpt":"Many real-world phenomena are best represented as interaction networks with dynamic structures (e.g., transaction networks, social networks, traffic networks). Interaction networks capture flow of data which is transferred between their vertices along a timeline. Analyzing such networks is crucial toward comprehend- ing processes in them. A typical analysis task is the finding of motifs, which are small subgraph patterns that repeat themselves in the network. In this paper, we introduce network flow motifs, a novel type of motifs that model significant flow transfer among a set of vertices wit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.08408","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":"1810.08408","created_at":"2026-05-18T00:02:48.179495+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.08408v1","created_at":"2026-05-18T00:02:48.179495+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.08408","created_at":"2026-05-18T00:02:48.179495+00:00"},{"alias_kind":"pith_short_12","alias_value":"VEWTW2XJCGLW","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VEWTW2XJCGLWPWSZ","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VEWTW2XJ","created_at":"2026-05-18T12:32:59.047623+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2601.04722","citing_title":"Toward Temporal Attribution Analytics in Dataflows","ref_index":34,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VEWTW2XJCGLWPWSZNRVF4VWV56","json":"https://pith.science/pith/VEWTW2XJCGLWPWSZNRVF4VWV56.json","graph_json":"https://pith.science/api/pith-number/VEWTW2XJCGLWPWSZNRVF4VWV56/graph.json","events_json":"https://pith.science/api/pith-number/VEWTW2XJCGLWPWSZNRVF4VWV56/events.json","paper":"https://pith.science/paper/VEWTW2XJ"},"agent_actions":{"view_html":"https://pith.science/pith/VEWTW2XJCGLWPWSZNRVF4VWV56","download_json":"https://pith.science/pith/VEWTW2XJCGLWPWSZNRVF4VWV56.json","view_paper":"https://pith.science/paper/VEWTW2XJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.08408&json=true","fetch_graph":"https://pith.science/api/pith-number/VEWTW2XJCGLWPWSZNRVF4VWV56/graph.json","fetch_events":"https://pith.science/api/pith-number/VEWTW2XJCGLWPWSZNRVF4VWV56/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VEWTW2XJCGLWPWSZNRVF4VWV56/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VEWTW2XJCGLWPWSZNRVF4VWV56/action/storage_attestation","attest_author":"https://pith.science/pith/VEWTW2XJCGLWPWSZNRVF4VWV56/action/author_attestation","sign_citation":"https://pith.science/pith/VEWTW2XJCGLWPWSZNRVF4VWV56/action/citation_signature","submit_replication":"https://pith.science/pith/VEWTW2XJCGLWPWSZNRVF4VWV56/action/replication_record"}},"created_at":"2026-05-18T00:02:48.179495+00:00","updated_at":"2026-05-18T00:02:48.179495+00:00"}