{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:BFGEJDH6UDYUVHUGTDNM6Y2ZFD","short_pith_number":"pith:BFGEJDH6","schema_version":"1.0","canonical_sha256":"094c448cfea0f14a9e8698dacf635928f6496a941b2cb084648d8915e4c43c0f","source":{"kind":"arxiv","id":"2107.10609","version":1},"attestation_state":"computed","paper":{"title":"Data Considerations in Graph Representation Learning for Supply Chain Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ajmal Aziz, Alexandra Brintrup, Edward Elson Kosasih, Ryan-Rhys Griffiths","submitted_at":"2021-07-22T12:28:15Z","abstract_excerpt":"Supply chain network data is a valuable asset for businesses wishing to understand their ethical profile, security of supply, and efficiency. Possession of a dataset alone however is not a sufficient enabler of actionable decisions due to incomplete information. In this paper, we present a graph representation learning approach to uncover hidden dependency links that focal companies may not be aware of. To the best of our knowledge, our work is the first to represent a supply chain as a heterogeneous knowledge graph with learnable embeddings. We demonstrate that our representation facilitates "},"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":"2107.10609","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-07-22T12:28:15Z","cross_cats_sorted":[],"title_canon_sha256":"f18f32abbcccf05ab0222d5fca963369730184517bbe6e576ba08a8c4521ecb1","abstract_canon_sha256":"2a10b0114b9e9a634b3bebc3cc69207197b33b05552c47c7e5020de405ab70a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:00:01.741975Z","signature_b64":"91+H79N/mMJKaK7dm3Bj6IQvIQmdXSHuE8pgvYiyWBfAp7UOeMR5idrUXOA6E95sakQz8YE0oWQ1BEWWi/qACg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"094c448cfea0f14a9e8698dacf635928f6496a941b2cb084648d8915e4c43c0f","last_reissued_at":"2026-07-05T03:00:01.741503Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:00:01.741503Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Data Considerations in Graph Representation Learning for Supply Chain Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ajmal Aziz, Alexandra Brintrup, Edward Elson Kosasih, Ryan-Rhys Griffiths","submitted_at":"2021-07-22T12:28:15Z","abstract_excerpt":"Supply chain network data is a valuable asset for businesses wishing to understand their ethical profile, security of supply, and efficiency. Possession of a dataset alone however is not a sufficient enabler of actionable decisions due to incomplete information. In this paper, we present a graph representation learning approach to uncover hidden dependency links that focal companies may not be aware of. To the best of our knowledge, our work is the first to represent a supply chain as a heterogeneous knowledge graph with learnable embeddings. We demonstrate that our representation facilitates "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.10609","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/2107.10609/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":"2107.10609","created_at":"2026-07-05T03:00:01.741562+00:00"},{"alias_kind":"arxiv_version","alias_value":"2107.10609v1","created_at":"2026-07-05T03:00:01.741562+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.10609","created_at":"2026-07-05T03:00:01.741562+00:00"},{"alias_kind":"pith_short_12","alias_value":"BFGEJDH6UDYU","created_at":"2026-07-05T03:00:01.741562+00:00"},{"alias_kind":"pith_short_16","alias_value":"BFGEJDH6UDYUVHUG","created_at":"2026-07-05T03:00:01.741562+00:00"},{"alias_kind":"pith_short_8","alias_value":"BFGEJDH6","created_at":"2026-07-05T03:00:01.741562+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.26835","citing_title":"Helicase: Uncertainty-Guided Supply Chain Knowledge Graph Construction with Autonomous Multi-Agent LLMs","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BFGEJDH6UDYUVHUGTDNM6Y2ZFD","json":"https://pith.science/pith/BFGEJDH6UDYUVHUGTDNM6Y2ZFD.json","graph_json":"https://pith.science/api/pith-number/BFGEJDH6UDYUVHUGTDNM6Y2ZFD/graph.json","events_json":"https://pith.science/api/pith-number/BFGEJDH6UDYUVHUGTDNM6Y2ZFD/events.json","paper":"https://pith.science/paper/BFGEJDH6"},"agent_actions":{"view_html":"https://pith.science/pith/BFGEJDH6UDYUVHUGTDNM6Y2ZFD","download_json":"https://pith.science/pith/BFGEJDH6UDYUVHUGTDNM6Y2ZFD.json","view_paper":"https://pith.science/paper/BFGEJDH6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2107.10609&json=true","fetch_graph":"https://pith.science/api/pith-number/BFGEJDH6UDYUVHUGTDNM6Y2ZFD/graph.json","fetch_events":"https://pith.science/api/pith-number/BFGEJDH6UDYUVHUGTDNM6Y2ZFD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BFGEJDH6UDYUVHUGTDNM6Y2ZFD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BFGEJDH6UDYUVHUGTDNM6Y2ZFD/action/storage_attestation","attest_author":"https://pith.science/pith/BFGEJDH6UDYUVHUGTDNM6Y2ZFD/action/author_attestation","sign_citation":"https://pith.science/pith/BFGEJDH6UDYUVHUGTDNM6Y2ZFD/action/citation_signature","submit_replication":"https://pith.science/pith/BFGEJDH6UDYUVHUGTDNM6Y2ZFD/action/replication_record"}},"created_at":"2026-07-05T03:00:01.741562+00:00","updated_at":"2026-07-05T03:00:01.741562+00:00"}