{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:GP76KS64Y7XMOU676EOSV3V36N","short_pith_number":"pith:GP76KS64","schema_version":"1.0","canonical_sha256":"33ffe54bdcc7eec753dff11d2aeebbf35312c2ab9f9ef06ee0756dde6d9e7b62","source":{"kind":"arxiv","id":"1904.03423","version":2},"attestation_state":"computed","paper":{"title":"FILDNE: A Framework for Incremental Learning of Dynamic Networks Embeddings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SI"],"primary_cat":"stat.ML","authors_text":"Kamil Tagowski, Maciej Falkiewicz, Nitesh V. Chawla, Piotr Bielak, Tomasz Kajdanowicz","submitted_at":"2019-04-06T11:46:54Z","abstract_excerpt":"Representation learning on graphs has emerged as a powerful mechanism to automate feature vector generation for downstream machine learning tasks. The advances in representation on graphs have centered on both homogeneous and heterogeneous graphs, where the latter presenting the challenges associated with multi-typed nodes and/or edges. In this paper, we consider the additional challenge of evolving graphs. We ask the question of whether the advances in representation learning for static graphs can be leveraged for dynamic graphs and how? It is important to be able to incorporate those advance"},"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":"1904.03423","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-04-06T11:46:54Z","cross_cats_sorted":["cs.LG","cs.SI"],"title_canon_sha256":"2d6bfb4b23db6caabddb56857d5836d174d490c6f614f69115329e33767d5654","abstract_canon_sha256":"73736ec1579a7e55835d51e65b62b63deeda85869edc2eb56e5ec14f74281834"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:53:06.329763Z","signature_b64":"mv2KUX3d8uCwNEX1pLoana4h8/KdUWIet4CIwVqBcDYEoeRHKo+fC0NZs0jLoNGkguCs8eozOwKAyNnngnU0Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33ffe54bdcc7eec753dff11d2aeebbf35312c2ab9f9ef06ee0756dde6d9e7b62","last_reissued_at":"2026-07-05T01:53:06.329291Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:53:06.329291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FILDNE: A Framework for Incremental Learning of Dynamic Networks Embeddings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SI"],"primary_cat":"stat.ML","authors_text":"Kamil Tagowski, Maciej Falkiewicz, Nitesh V. Chawla, Piotr Bielak, Tomasz Kajdanowicz","submitted_at":"2019-04-06T11:46:54Z","abstract_excerpt":"Representation learning on graphs has emerged as a powerful mechanism to automate feature vector generation for downstream machine learning tasks. The advances in representation on graphs have centered on both homogeneous and heterogeneous graphs, where the latter presenting the challenges associated with multi-typed nodes and/or edges. In this paper, we consider the additional challenge of evolving graphs. We ask the question of whether the advances in representation learning for static graphs can be leveraged for dynamic graphs and how? It is important to be able to incorporate those advance"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.03423","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1904.03423/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":"1904.03423","created_at":"2026-07-05T01:53:06.329356+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.03423v2","created_at":"2026-07-05T01:53:06.329356+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.03423","created_at":"2026-07-05T01:53:06.329356+00:00"},{"alias_kind":"pith_short_12","alias_value":"GP76KS64Y7XM","created_at":"2026-07-05T01:53:06.329356+00:00"},{"alias_kind":"pith_short_16","alias_value":"GP76KS64Y7XMOU67","created_at":"2026-07-05T01:53:06.329356+00:00"},{"alias_kind":"pith_short_8","alias_value":"GP76KS64","created_at":"2026-07-05T01:53:06.329356+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/GP76KS64Y7XMOU676EOSV3V36N","json":"https://pith.science/pith/GP76KS64Y7XMOU676EOSV3V36N.json","graph_json":"https://pith.science/api/pith-number/GP76KS64Y7XMOU676EOSV3V36N/graph.json","events_json":"https://pith.science/api/pith-number/GP76KS64Y7XMOU676EOSV3V36N/events.json","paper":"https://pith.science/paper/GP76KS64"},"agent_actions":{"view_html":"https://pith.science/pith/GP76KS64Y7XMOU676EOSV3V36N","download_json":"https://pith.science/pith/GP76KS64Y7XMOU676EOSV3V36N.json","view_paper":"https://pith.science/paper/GP76KS64","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.03423&json=true","fetch_graph":"https://pith.science/api/pith-number/GP76KS64Y7XMOU676EOSV3V36N/graph.json","fetch_events":"https://pith.science/api/pith-number/GP76KS64Y7XMOU676EOSV3V36N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GP76KS64Y7XMOU676EOSV3V36N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GP76KS64Y7XMOU676EOSV3V36N/action/storage_attestation","attest_author":"https://pith.science/pith/GP76KS64Y7XMOU676EOSV3V36N/action/author_attestation","sign_citation":"https://pith.science/pith/GP76KS64Y7XMOU676EOSV3V36N/action/citation_signature","submit_replication":"https://pith.science/pith/GP76KS64Y7XMOU676EOSV3V36N/action/replication_record"}},"created_at":"2026-07-05T01:53:06.329356+00:00","updated_at":"2026-07-05T01:53:06.329356+00:00"}